default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd SCG 1986: Yorktown Heights, NY, USA
- Alok Aggarwal:
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986. ACM 1986, ISBN 0-89791-194-6 - Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan:
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. 1-13 - Subhash Suri, Joseph O'Rourke:
Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. 14-23 - Wei-pang Chin, Simeon C. Ntafos:
Optimum Watchman Routes. 24-33 - Cao An Wang, Edward P. F. Chan:
Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons. 34-42 - J. Mark Keil:
Minimally Covering a Horizontally Convex Orthogonal Polygon. 43-51 - David Rappaport, Hiroshi Imai, Godfried T. Toussaint:
On Computing Simple Circuits on a Set of Line Segments. 52-60 - David Haussler, Emo Welzl:
Epsilon-Nets and Simplex Range Queries. 61-71 - Andrzej Lingas:
On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets. 72-79 - Dan E. Willard:
On the Application of Shared Retrieval to Orthogonal Range Queries. 80-89 - Leonidas J. Guibas, Raimund Seidel:
Computing Convolutions by Reciprocal Search. 90-99 - Christos Levcopoulos:
Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. 100-108 - Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
Optimal Dynamic Solutions for Fixed Windowing Problems. 109-115 - Gopalakrishnan Vijayan:
Geometry of Planar Graphs with Angles. 116-124 - Henry Crapo, Juliette Ryan:
Scene Analysis and Geometric Homology. 125-132 - David Avis, Hossam A. ElGindy:
Triangulating Simplicial Point Sets in Space. 133-141 - Walter Whiteley:
Two Algorithms for Polyhedral Pictures. 142-149 - David M. Mount:
Storing the Subdivision of a Polyhedral Surface. 150-158 - A. H. Schoen:
A Defect-Correction algorithm for Minimizing the Volume of a Simple Polyhedron Which Circumscribes a Sphere. 159-168 - Paul Chew:
There is a Planar Graph Almost as Good as the Complete Graph. 169-177 - Shmuel Sifrony, Micha Sharir:
A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space. 178-186 - S. Maddila, Chee-Keng Yap:
Moving a Polygon Around the Corner in a Corridor. 187-192 - Micha Sharir, Avikam Baltsan:
On Shortest Paths Amidst Convex Polyhedra. 193-206 - V. Visvanathan, Linda S. Milor
:
An Efficient Algorithm to Determine the Image of a Parallelepiped Under a Linear Transformation. 207-215 - Mikhail J. Atallah, Michael T. Goodrich:
Efficient Plane Sweeping in Parallel. 216-225 - Per-Olof Fjällström:
Smoothing of Polyhedral Hodels. 226-235 - Dayong Zhang, Adrian Bowyer:
CSG Set-Theoretic Solid Modelling and NC Machining of Blend Aurfaces. 236-245 - D. A. Field:
Implementing Watson's Algorithm in Three Dimensions. 246-259 - Jean-Daniel Boissonnat, Monique Teillaud:
The Hierarchical Representation of Objects: The Delaunay Tree. 260-268 - Ferenc Dévai:
Quadratic Bounds for Hidden Line Elimination. 269-275 - Rex A. Dwyer:
A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time. 276-284 - Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber:
Geometric Applications of a Matrix Searching Algorithm. 285-292 - Bernard Chazelle, Herbert Edelsbrunner:
Linear Data Structures for Two Types of Range Search. 293-302 - Rajeev Motwani, Prabhakar Raghavan:
Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems. 303-312 - Steven Fortune:
A Sweepline Algorithm for Voronoi Diagrams. 313-322
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-07-05 02:35 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:
