Lu, M.,
Varman, P.,
Solving Geometric Proximity Problems On Mesh-Connected Computers,
CAPAIDM(86), pp. 248-255.
BibRef
Chang, R.C.,
Lee, R.C.T.,
An O(N Log N) Minimal Spanning Tree Algorithm For N Points In The Plane,
BIT(26), 1986, pp. 7-16.
BibRef
Edelsbrunner, H.,
Seidel, R.,
Voronoi Diagrams And Arrangements,
DCG(1), 1986, pp. 25-44.
BibRef
Lingas, A.,
The Greedy And Delauney Triangulations Are Not Bad In The Average Case,
IPL(22), 1986, pp. 25-31.
BibRef
Krivanek, M.,
Hexagonal Unit Network-A Tool For Proving The Np-Completeness Results Of Geometric Problems,
IPL(22), 1986, pp. 37-41.
BibRef
Aurenhammer, F.,
The One-Dimensional Weighted Voronoi Diagram,
IPL(22), 1986, pp. 119-123.
BibRef
Cockayne, E.J.,
Hewgill, D.E.,
Exact Computation Of Steiner Minimal Trees In The Plane,
IPL(22), 1986, pp. 151-156.
BibRef
Chazelle, B.,
Cole, R.,
Preparata, F.P.,
Yap, C.,
New Upper Bounds For Neighbor Searching,
IC(68), 1986, pp. 105-124.
BibRef
Lee, D.T.,
Wu, Y.F.,
Geometric Complexity Of Some Location Problems,
ALGORITHMICA(1), 1986, pp. 193-211.
BibRef
Katajainen, J.,
Nevalainen, O.,
Computing Relative Neighbourhood Graphs In The Plane,
PR(19), 1986, pp. 221-228.
BibRef
Megiddo, N.,
Zemel, E.,
An O(N Log N) Randomizing Algorithm For The Weighted Euclidean 1-Center Problem,
J. ALGORITHMS(7), 1986, pp. 358-368.
BibRef
Aggarwal, A.,
Melville, R.C.,
Fast Computation Of The Modality Of Polygons,
J. ALGORITHMS(7), 1986, pp. 369-381.
BibRef
Wang, C.A.,
Chan, E.P.F.,
Finding The Minimum Visible Vertex Distance Between Two Nonintersecting Simple Polygons,
CG(86), pp. 34-42.
BibRef
Lingas, A.,
On Approximation Behavior And Implementation Of The Greedy Triangulation For Convex Planar Point Sets,
CG(86), pp. 72-79.
BibRef
Avis, D.,
ElGindy, H.,
Triangulating Simplicial Point Sets In Space,
CG(86), pp. 133-141.
BibRef
Chew, L.P.,
There Is A Planar Graph Almost As Good As The Complete Graph,
CG(86), pp. 169-177.
BibRef
Dwyer, R.A.,
A Simple Divide-And-Conquer Algorithm For Constructing Delaunay Triangulations In O(N Log Log N) Expected Time,
CG(86), pp. 276-284.
BibRef
Fortune, S.,
A Sweepline Algorithm For Voronoi Diagrams,
CG(86), pp. 313-322.
BibRef
Vidal Ruiz, E.,
An Algorithm For Finding Nearest Neighbors In (Approximately) Constant Time,
PRL(4), 1986, pp. 145-157.
BibRef
Vaidya, P.M.,
An Optimal Algorithm For The All-Nearest-Neighbors Problem,
SFCS(86), pp. 117-122.
BibRef
Arcelli, C.,
Sanniti di Baja, G.,
Computing Voronoi Diagrams In Digital Pictures,
PRL(4), 1986, pp. 383-389.
BibRef
Chapter on Rosenfeld Bibliography for 1986 continues in
H.3. Visibility, Path Planning, etc. .