default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st Symposium on Computational Geometry 1985: Baltimore, Maryland, USA
- Joseph O'Rourke:
Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985. ACM 1985, ISBN 0-89791-163-6 - Michael E. Houle, Godfried T. Toussaint:
Computating the width of a set. 1-7 - Glenn Davis:
Computing separating planes for pairs of disjoint polytopes. 8-14 - James J. Little:
Extended Gaussian images, mixed volumes, shape reconstruction. 15-23 - Michael McKenna, Raimund Seidel:
Finding the optimal shadows of a convex polytope. 24-28 - Mark Segal, Carlo H. Séquin:
Consistent calculations for solids modeling. 29-38 - Pradeep Sinha, Eric Klassen, K. K. Wang:
Exploiting topological and geometric properties for selective subdivision. 39-45 - Jean-Daniel Boissonnat:
Reconstruction of solids. 46-54 - Norm Dadoun, David G. Kirkpatrick, John P. Walsh:
The geometry of beam tracing. 55-61 - Deborah A. Joseph, W. Harry Plantinga:
On the complexity of reachability and motion planning questions (extended abstract). 62-66 - A. Koutsou:
A geometric reasoning system for moving an object while maintaining contact with others. 67-74 - Klara Kedem, Micha Sharir:
An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles. 75-80 - Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann:
The direct dominance problem. 81-88 - David G. Kirkpatrick, Raimund Seidel:
Output-size sensitive algorithms for finding maximal vectors. 89-96 - Anna Lubiw:
Decomposing polygonal regions into convex quadrilaterals. 97-106 - Bernard Chazelle, Franco P. Preparata:
Halfspace range search: an algorithmic application of K-sets. 107-115 - David Avis:
On the partitionability of point sets in space (preliminary report). 116-120 - Jacob E. Goodman, Richard Pollack:
Modeling planar configurations. 121-124 - Bernard Chazelle:
New techniques for computing order statistics in Euclidean space (extended abstract). 125-134 - Bernard Chazelle, Leonidas J. Guibas:
Visibility and intersectin problems in plane geometry. 135-146 - Stephen K. Wismath:
Characterizing bar line-of-sight graphs. 147-152 - Richard J. Lipton, Stephen C. North, Jonathan S. Sandberg:
A method for drawing graphs. 153-160 - David Avis, David Rappaport:
Computing the largest empty convex subset of a set of points. 161-167 - Otfried Fries, Kurt Mehlhorn, Stefan Näher:
Dynamization of geometric data structures. 168-176 - Mark H. Overmars:
Range searching in a set of line segments. 177-185 - Peter Widmayer, Ying-Fung Wu, C. K. Wong:
Distance problems in computational geometry with fixed orientations. 186-195 - Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan:
Sorting Jordan sequences in linear time. 196-203 - Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu:
Rectilinear shortest paths with rectangular barriers. 204-213 - L. Paul Chew:
Planning the shortest path for a disc in O(n2log n) time. 214-220 - Daniel Leven, Micha Sharir:
An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract). 221-227 - Bernard Chazelle, Herbert Edelsbrunner:
An improved algorithm for constructing kth-order Voronoi diagrams. 228-234 - L. Paul Chew, Robert L. (Scot) Drysdale III:
Voronoi diagrams based on convex distance functions. 235-244 - Frank K. H. A. Dehne, Hartmut Noltemeier:
A computational geometry approach to clustering problems. 245-250 - Herbert Edelsbrunner, Raimund Seidel:
Voronoi diagrams and arrangements. 251-262 - Russ Miller, Quentin F. Stout:
Pyramid computer algorithms for determining geometric properties of images. 263-271 - Claude Puech, Hossein Yahia:
Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing. 272-280 - Teofilo F. Gonzalez, Si-Qing Zheng:
Bounds for partitioning rectilinear polygons. 281-287 - Andrzej Lingas:
On partitioning polygons. 288-295 - Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
Finding minimal convex nested polygons. 296-304 - Joseph C. Culberson, Gregory J. E. Rawlins:
Turtlegons: generating simple polygons for sequences of angles. 305-310 - Derick Wood, Chee-Keng Yap:
Computing a convex skill of an orthogonal polygon. 311-315 - Mark H. Overmars, Emo Welzl:
The complexity of cutting paper (extended abstract). 316-321
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-17 21:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
