Bern, M.W.,
Two Probabilistic Results On Rectilinear Steiner Trees,
ALGORITHMICA(3), 1988, pp. 191-204.
BibRef
Karlsson, R.G.,
Greedy Matching On A Grid,
BIT(28), 1988, pp. 19-26.
BibRef
Katajainen, J.,
Metric
The Region Approach For Computing Relative Neighbourhood Graphs In The L
COMPUTING(40), 1988, pp. 147-161.
BibRef
Canny, J.,
Donald, B.,
Simplified Voronoi Diagrams,
DCG(3), 1988, pp. 219-236.
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,
DCG(3), 1988, pp. 281-293.
BibRef
Hwang, F.K.,
Song, G.D.,
Ting, G.Y.,
Du, D.Z.,
A Decomposition Theorem On Euclidean Steiner Minimal Trees,
DCG(3), 1988, pp. 367-382.
BibRef
Hinrichs, K.,
Nievergelt, J.,
Schorn, P.,
Plane-Sweep Solves The Closest Pair Problem Elegantly,
IPL(26), 1988, pp. 255-261.
BibRef
Mehlhorn, K.,
A Faster Approximation Algorithm For The Steiner Problem In Graphs,
IPL(27), 1988, pp. 125-128.
BibRef
Baltsan, A.,
Sharir, M.,
On The Shortest Paths Between Two Convex Polyhedra,
J. ACM(33), 1988, pp. 267-287.
BibRef
Aurenhammer, F.,
Improved Algorithms For Discs And Balls Using Power Diagrams,
J. ALGORITHMS(9), 1988, pp. 151-161.
BibRef
Watson, D.F.,
Natural Neighbor Sorting On The N-Dimensional Sphere,
PR(21), 1988, pp. 63-67.
BibRef
Bienstock, D.,
Monma, C.L.,
On The Complexity Of Covering Vertices By Faces In A Planar Graph,
SIAM JC(17), 1988, pp. 53-76.
BibRef
D'Atri, A.,
Moscarini, M.,
Distance-Hereditary Graphs, Steiner Trees, And Connected Domination,
SIAM JC(17), 1988, pp. 521-530.
BibRef
Vaidya, P.M.,
Minimum Spanning Trees In K-Dimensional Space,
SIAM JC(17), 1988, pp. 572-582.
BibRef
Clarkson, K.L.,
A Randomized Algorithm For Closest-Point Queries,
SIAM JC(17), 1988, pp. 830-847.
BibRef
Provan, J.S.,
An Approximation Scheme For Finding Steiner Trees With Obstacles,
SIAM JC(17), 1988, pp. 920-934.
BibRef
Dyer, M.E.,
Frieze, A.M.,
On The Complexity Of Computing The Volume Of A Polyhedron,
SIAM JC(17), 1988, pp. 967-974.
BibRef
Bajaj, C.,
Geometric Optimization And The Polynomial Hierarchy,
TCS(54), 1987, pp. 87-102.
BibRef
Houle, M.E.,
Toussaint, G.T.,
Computing The Width Of A Set,
T-PAMI(10), 1988, pp. 761-765.
BibRef
Avis, D.,
Bhattacharya, B.K.,
Imai, H.,
Computing The Volume Of The Union Of Spheres,
VC(3), 1988, pp. 323-328.
BibRef
ElGindy, H.,
Goodrich, M.,
Parallel Algorithms For Shortest Path Problems In Polygons,
VC(3), 1988, pp. 371-378.
BibRef
Bhattacharya, B.K.,
Toussaint, G.T.,
Fast Algorithms For Computing The Diameter Of A Finite Planar Set,
VC(3), 1988, pp. 379-388.
BibRef
Willard, D.E.,
Wee, Y.C.,
Quasi-Valid Range Querying And Its Implications For Nearest Neighbor Problems,
CG(88), pp. 34-43.
BibRef
Mount, D.M.,
Saalfeld, A.,
Globally-Equiangular Triangulations Of Co-Circular Points In O(N Log N) Time,
CG(88), pp. 143-152.
BibRef
Aronov, B.,
Fortune, S.,
Wilfong, G.,
The Furthest-Site Geodesic Voronoi Diagram,
CG(88), pp. 229-240.
BibRef
Monma, C.,
Paterson, M.,
Suri, S.,
Yao, F.,
Computing Euclidean Maximum Spanning Trees,
CG(88), pp. 241-251.
BibRef
Asano, T.,
Bhattacharya, B.,
Keil, M.,
Yao, F.,
Clustering Algorithms Based On Minimum And Maximum Spanning Trees,
CG(88), pp. 252-257.
BibRef
Mitchell, J.S.B.,
On Maximum Flows In Polyhedral Domains,
CG(88), pp. 341-351.
BibRef
ElGindy, H.A.,
Toussaint, G.T.,
Computing The Relative Neighbour Decomposition Of A Simple Polygon,
CM(88), pp. 53-70.
BibRef
Toriwaki, J.I.,
Yokoi, S.,
Voronoi And Related Neighbors On Digitized Two-Dimensional Space With Applications To Texture Analysis,
CM(88), pp. 207-228.
BibRef
Toussaint, G.T.,
A Graph-Theoretic Primal Sketch,
CM(88), pp. 229-260.
BibRef
Chapter on Rosenfeld Bibliography for 1988 continues in
H.5. Path planning .