12.21.3 H.3. Distance, etc.

Chapter Contents (Back)

Bern, M.W.,
Two Probabilistic Results On Rectilinear Steiner Trees,
STOC(87), pp. 433-441. BibRef

Lenhart, W., Pollack, R., Sack, J., Seidel, R., Sharir, M., Suri, S., Toussaint, G., Whitesides, S., Yap, C.,
Computing The Link Center Of A Simple Polygon,
CG(87), pp. 1-10. BibRef

Aronov, B.,
On The Geodesic Voronoi Diagram Of Point Sites In A Simple Polygon,
CG(87), pp. 39-49. BibRef

Guibas, L.J., Hershberger, J.,
Optimal Shortest Path Queries In A Simple Polygon,
CG(87), pp. 50-63. BibRef

Suri, S.,
The All-Geodesic-Furthest Neighbors Problem For Simple Polygons,
CG(87), pp. 64-75. BibRef

Canny, J., Donald, B.,
Simplified Voronoi Diagrams,
CG(87), pp. 153-161. BibRef

Dillencourt, M.B.,
Toughness And Delaunay Triangulations,
CG(87), pp. 186-194. BibRef

Saalfeld, A.,
Joint Triangulations And Triangulation Maps,
CG(87), pp. 195-204. BibRef

Chen, L.P.,
Constrained Delaunay Triangulations,
CG(87), pp. 215-222. BibRef

Wang, C.A., Schubert, L.,
An Optimal Algorithm For Constructing The Delaunay Triangulation Of A Set Of Line Segments,
CG(87), pp. 223-232. BibRef

Jaromczyk, J.W., Kowaluk, M.,
A Note On Relative Neighborhood Graphs,
CG(87), pp. 233-241. BibRef

Aggarwal, A., Suri, S.,
Fast Algorithms For Computing The Largest Empty Rectangle,
CG(87), pp. 278-290. BibRef

Franklin, W.R., Akman, V., Verrilli, C.,
Voronoi Diagrams With Barriers And On Polyhedra For Minimal Path Planning,
VC(1), 1985, pp. 133-150. BibRef

Dehne, F., Noltemeier, H.,
Clustering Methods For Geometric Objects And Applications To Design Problems,
VC(2), 1986, pp. 31-38. BibRef

Dehne, F.,
Optical Clustering,
VC(2), 1986, pp. 39-43. BibRef

O'Rourke, J., Booth, H., Washington, R.,
Connect-The-Dots: A New Heuristic,
CVGIP(39), 1987, pp. 258-266. BibRef

O'Dunlaing, C., Sharir, M., Yap, C.,
Generalized Voronoi Diagrams For A Ladder: Ii. Efficient Construction Of The Diagram,
ALGORITHMICA(2), 1987, pp. 27-59. BibRef

Dwyer, R.A.,
A Faster Divide-And-Conquer Algorithm For Constructing Delaunay Triangulations,
ALGORITHMICA(2), 1987, pp. 137-151. BibRef

Fortune, S.,
A Sweepline Algorithm For Voronoi Diagrams,
ALGORITHMICA(2), 1987, pp. 153-174. BibRef

Aggarwal, A., Klawe, M.M., Moran, S., Shor, P., Wilber, R.,
Geometric Applications Of A Matrix-Searching Algorithm,
ALGORITHMICA(2), 1987, pp. 195-208. BibRef

Jamison, R.E.,
Direction Trees,
DCG(2), 1987, pp. 249-254. BibRef

Yap, C.K.,
An O(Nlogn) Algorithm For The Voronoi Diagram Of A Set Of Simple Curve Segments,
DCG(2), 1987, pp. 365-393. BibRef

Du, D.Z., Hwang, F.K., Song, G.D., Ting, G.Y.,
Steiner Minimal Trees On Sets Of Four Points,
DCG(2), 1987, pp. 401-414. BibRef

Asano, T., Asano, T., Imai, H.,
Shortest Path Between Two Simple Polygons,
IPL(24), 1987, pp. 285-288. BibRef

Widmayer, P., Wood, D.,
Time- And Space-Optimal Contour Computation For A Set Of Rectangles,
IPL(24), 1987, pp. 335-338. BibRef

Katajainen, J., Nevalainan, O., Teuhola, J.,
A Linear Expected-Time Algorithm For Computing Planar Relative Neighborhood Graphs,
IPL(25), 1987, pp. 77-86. BibRef

Dillencourt, M.B.,
A Non-Hamiltonian, Nondegenerate Delaunay Triangulation,
IPL(25), 1987, pp. 149-151. BibRef

Levcopoulos, C.,
An Z(N) Lower Bound For The Nonoptimality Of The Greedy Triangulation,
IPL(25), 1987, pp. 247-251. BibRef

Merks, E.,
An Optimal Parallel Algorithm For Triangulating A Set Of Points In The Plane,
INTL. J. PARALLEL PROGRAMMING(15), 1986, pp. 399-411. BibRef

Georgakopoulos, G., Papadimitriou, C.H.,
The 1-Steiner Tree Problem,
J. ALGORITHMS(8), 1987, pp. 122-130. BibRef

Plaisted, D.A., Hong, J.,
A Heuristic Triangulation Algorithm,
J. ALGORITHMS(8), 1987, pp. 405-437. BibRef

Aurenhammer, F.,
Power Diagrams: Properties, Algorithms And Applications,
SIAM JC(16), 1987, pp. 78-96. BibRef

Widmayer, P., Wu, Y.F., Wong, C.K.,
On Some Distance Problems In Fixed Orientations,
SIAM JC(16), 1987, pp. 728-746. BibRef

Wu, Y.F., Widmayer, P., Schlag, M.D.F., Wong, C.K.,
Rectilinear Shortest Paths,
T-COMP(36), 1987, pp. 321-331. BibRef

Chazelle, B., Edelsbrunner, H.,
An Improved Algorithm For Constructing Kth-Order Voronoi Diagrams,
T-COMP(36), 1987, pp. 1349-1354. BibRef

Chapter on Rosenfeld Bibliography for 1987 continues in
H.4. Containment, covering, decomposition, packing, layout, etc. .

Last update:Jun 7, 2018 at 10:14:50