Edelsbrunner, H.,
Guibas, L.J.,
Topologically Sweeping An Arrangment,
STOC(87), pp. 389-403.
BibRef
Seidel, R.,
Constructing Higher Dimensional Convex Hulls At Logarithmic Cost Per Face,
STOC(87), pp. 404-413.
BibRef
Hershberger, J.,
Finding The Visibility Graph Of A Simple Polygon In Time Proportional To Its Size,
CG(87), pp. 11-20.
BibRef
Aurenhammer, F.,
Jordan Sorting Via Convex Hulls Of Certain Non-Simple Polygons,
CG(87), pp. 21-29.
BibRef
Mitchell, J.S.B.,
Papadimitriou, C.H.,
The Weighted Region Problem,
CG(87), pp. 30-38.
BibRef
Dadom, N.,
Kirkpatrick, D.G.,
Parallel Processing For Efficient Subdivision Search,
CG(87), pp. 205-214.
BibRef
Edahiro, M.,
Tanaka, K.,
Hoshino, T.,
Asano, T.,
A Bucketing Algorithm For The Orthogonal Segment Intersection Search Pattern And Its Practical Efficiency,
CG(87), pp. 258-267.
BibRef
Munro, J.I.,
Overmars, M.H.,
Wood, D.,
Variations On Visibility,
CG(87), pp. 291-299.
BibRef
Kirkpatrick, D.G.,
Establishing Order In Planar Subdivisions,
CG(87), pp. 316-321.
BibRef
Alon, N.,
Haussler, D.,
Welzl, E.,
Partitioning And Geometric Embedding Of Range Spaces Of Finite Vapnik-Chervonenkis Dimension,
CG(87), pp. 331-340.
BibRef
Nicholl, T.M.,
Lee, D.T.,
Nicholl, R.A.,
An Efficient New Algorithm For 2-D Line Clipping: Its Development And Analysis,
SIGGRAPH(87), pp. 253-262.
BibRef
Aggarwal, A.,
Chang, J.S.,
Yap, C.K.,
Minimum Area Circumscribing Polygons,
VC(1), 1985, pp. 112-117.
BibRef
Toussaint, G.T.,
A Single Linear Algorithm For Intersecting Convex Polygons,
VC(1), 1985, pp. 118-123.
BibRef
Avis, D.,
Gum, T.,
Toussaint, G.,
Visibility Between Two Edges Of A Simple Polygon,
VC(2), 1986, pp. 342-357.
BibRef
Sobkow, M.S.,
Pospisil, P.,
Yang, Y.H.,
A Fast Two-Dimensional Line Clipping Algorithm Via Line Encoding,
C&G(11), 1987, pp. 459-467.
BibRef
Chazelle, B.,
Some Techniques For Geometric Searching With Implicit Set Representations,
ACTA INFORMATICA(24), 1987, pp. 565-582.
BibRef
Chen, G.H.,
Chern, M.S.,
Lee, R.C.T.,
A New Systolic Architecture For Convex Hull And Half-Plane Intersection Problems,
BIT(27), 1987, pp. 141-147.
BibRef
Katchalski, M.,
Lewis, T.,
Liu, A.,
Geometric Permutations And Common Transversals,
DCG(1), 1986, pp. 371-377.
BibRef
Chazelle, B.,
Edelsbrunner, H.,
Linear Space Data Structures For Two Types Of Range Search,
DCG(2), 1987, pp. 113-126.
BibRef
Haussler, D.,
Welzl, E.,
Epsilon-Nets And Simplex Range Queries,
DCG(2), 1987, pp. 127-151.
BibRef
Guibas, L.J.,
Seidel, R.,
Computing Convolutions By Reciprocal Search,
DCG(2), 1987, pp. 175-193.
BibRef
Rawlins, G.J.E.,
Wood, D.,
Optimal Computation Of Finitely Oriented Convex Hulls,
IC(72), 1987, pp. 150-166.
BibRef
Edelsbrunner, H.,
Welzl, E.,
Halfplanar Range Search In Linear Space And O(N0.695) Query Time,
IPL(23), 1986, pp. 289-293.
BibRef
Rey, C.,
Ward, R.,
On Determining The On-Line Minimax Linear Fit To A Discrete Point Set In The Plane,
IPL(24), 1987, pp. 97-101.
BibRef
Akman, V.,
An Algorithm For Determining An Opaque Minimal Forest Of A Convex Polygon,
IPL(24), 1987, pp. 193-198.
BibRef
Edelsbrunner, H.,
Overmars, M.H.,
Zooming By Repeated Range Detection,
IPL(24), 1987, pp. 413-417.
BibRef
Atallah, M.,
Bajaj, C.,
Efficient Algorithms For Common Transversals,
IPL(25), 1987, pp. 87-91.
BibRef
Klopper, A.,
A Lower Bound On The Complexity Of The Convex Hull For Simple Polyhedra,
IPL(25), 1987, pp. 159-161.
BibRef
Fries, O.,
Mehlhorn, K.,
Naher, S.,
Tsakalidis, A.,
A Log Log N Data Structure For Three-Sided Range Queries,
IPL(25), 1987, pp. 269-273.
BibRef
Gries, D.,
Stojmenovic, I.,
A Note On Graham'S Convex Hull Algorithm,
IPL(25), 1987, pp. 323-327.
BibRef
Ottmann, T.,
Soisalon-Soininen, E.,
Partitioning And Separating Sets Of Orthogonal Polygons,
IS(42), 1987, pp. 31-49.
BibRef
Guting, R.H.,
Schilling, W.,
A Practical Divide-And-Conquer Algorithm For The Rectangle Intersection Problem,
IS(42), 1987, pp. 95-112.
BibRef
Inselberg, A.,
Chomut, T.,
Reif, M.,
Convexity Algorithms In Parallel Coordinates,
J. ACM(34), 1987, pp. 765-801.
BibRef
Willard, D.E.,
Multidimensional Search Trees That Provide New Types Of Memory Reductions,
J. ACM(34), 1987, pp. 846-858.
BibRef
Imai, H.,
Asano, T.,
Dynamic Orthogonal Segment Intersection Search,
J. ALGORITHMS(8), 1987, pp. 1-18.
BibRef
Schaffer, A.A.,
Van Wyk, C.J.,
Convex Hulls Of Piecewise-Smooth Jordan Curves,
J. ALGORITHMS(8), 1987, pp. 66-94.
BibRef
Dobkin, D.P.,
Edelsbrunner, H.,
Space Searching For Intersecting Objects,
J. ALGORITHMS(8), 1987, pp. 348-361.
BibRef
Stojmenovic, I.,
Evans, D.J.,
Comments On Two Parallel Algorithms For The Planar Convex Hull Problem,
PARALLEL COMPUTING(5), 1987, pp. 373-375.
BibRef
Peuquet, D.J.,
Zhan, C.X.,
An Algorithm To Determine The Directional Relationship Between Arbitrarily-Shaped Polygons In The Plane,
PR(20), 1987, pp. 65-74.
BibRef
Kundu, S.,
A New O(Nlogn) Algorithm For Computing The Intersection Of Convex Polygons,
PR(20), 1987, pp. 419-424.
BibRef
Toussaint, G.T.,
A Linear-Time Algorithm For Solving The Strong Hidden-Line Problem In A Simple Polygon,
PRL(4), 1986, pp. 449-451.
BibRef
Cole, R.,
Sharir, M.,
Yap, C.K.,
On K-Hulls And Related Problems,
SIAM JC(16), 1987, pp. 61-77.
BibRef
Cole, R.,
Partitioning Point Sets In Arbitrary Dimensions,
TCS(49), 1987, pp. 239-265.
BibRef
Bailey, T.,
Cowles, J.,
A Convex Hull Inclusion Test,
T-PAMI(9), 1987, pp. 312-316.
BibRef
Chapter on Rosenfeld Bibliography for 1987 continues in
H.3. Distance, etc. .