Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Sanjiv Kapoor, S. N. Maheshwari |
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Michael McKenna, Joseph O'Rourke |
Arrangements of Lines in 3-Space: A Data Structure with Applications. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Klara Kedem, Micha Sharir |
An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao |
Computing Euclidean Maximum Spanning Trees. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Herbert Edelsbrunner, Ernst P. Mücke |
Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Bruce Randall Donald |
The Complexity of Planar Compliant Motion Planning Under Uncertainty. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Kenneth L. Clarkson |
Applications of Random Sampling in Computational Geometry, II. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Joseph S. B. Mitchell |
On Maximum Flows in Polyhedral Domains. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Shaodi Gao, Mark Jerrum, Michael Kaufmann 0001, Kurt Mehlhorn, Wolfgang Rülling |
On Continuous Homotopic One Layer Routing. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Rajeev Motwani 0001, Arvind Raghunathan, Huzur Saran |
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony |
On the General Motion Planning Problem with Two Degrees of Freedom. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk |
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Richard Cole 0001, Michael T. Goodrich |
Optimal Parallel Algorithms for Polygon and Point-Set Problems. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Kenneth L. Clarkson, Peter W. Shor |
Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | David P. Dobkin, Deborah Silver |
Recipes for Geometry and Numerical Analysis - Part I: An Empirical Study. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Herbert Edelsbrunner (eds.) |
Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988 |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Pankaj K. Agarwal, Micha Sharir |
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger 0001, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl |
Implicitly Representing Arrangements of Lines or Segments. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Micha Sharir, Shmuel Sifrony |
Coordinated Motion Planning for Two Independent Robots. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Jerzy W. Jaromczyk, Miroslaw Kowaluk |
Skewed Projections with an Application to Line Stabbing in R3. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | L. W. Ericson, Chee-Keng Yap |
The Design of LINETOOL, a Geometric Editor. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | John H. Reif, Sandeep Sen |
An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai |
Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Buchberger |
Algebraic Methods for Non-Linear Computational Geometry (Invited Address). |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Boris Aronov, Steven Fortune, Gordon T. Wilfong |
The Furthest-Site Geodesic Voronoi Diagram. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | B. K. Natarajan |
On Planning Assemblies. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Mordecai J. Golin, Robert Sedgewick |
Analysis of a Simple Yet Efficient Convex Hull Algorithm. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir |
The Complexity of Many Faces in Arrangements of Lines and of Segments. |
SCG |
1988 |
DBLP DOI BibTeX RDF |
|
1 | Noga Alon, David Haussler, Emo Welzl |
Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Chandrajit L. Bajaj, Myung-Soo Kim |
Compliant Motion Planning with Geometric Models. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | David P. Dobkin, Michael J. Laszlo |
Primitives for the Manipulation of Three-Dimensional Subdivisions. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | John F. Canny, Bruce Randall Donald |
Simplified Voronoi Diagrams. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Alan Saalfeld |
Joint Triangulations and Triangulation Maps. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap |
Computing the Link Center of a Simple Polygon. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | L. Paul Chew |
Constrained Delaunay Triangulations. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Norm Dadoun, David G. Kirkpatrick |
Parallel Processing for Efficient Subdivision Search. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Alok Aggarwal, Subhash Suri |
Fast Algorithms for Computing the Largest Empty Rectangle. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Leila De Floriani |
A Graph Based Approach to Object Feature Recognition. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl |
Congruence, Similarity, and Symmetries of Geometric Objects. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Michael B. Dillencourt |
Toughness and Delaunay Triangulations. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Jerzy W. Jaromczyk, Miroslaw Kowaluk |
A Note on Relative Neighborhood Graphs. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Yan Ke, Joseph O'Rourke |
Moving a Ladder in Three Dimensions: Upper and Lower Bounds. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | John Hershberger 0001 |
Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya |
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Wm. Randolph Franklin |
Polygon Properties Calculated from the Vertex Neighborhoods. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich |
Numerical Stability of Geometric Algorithms. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino 0003, Takao Asano |
A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | J. Ian Munro, Mark H. Overmars, Derick Wood |
Variations on Visibility. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Robert A. Reckhow, Joseph C. Culberson |
Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Jorge Stolfi |
Oriented Projective Geometry. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Franz Aurenhammer |
Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Raimund Seidel |
On the Number of Faces in Higher-Dimensional Voronoi Diagrams. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Joe D. Warren |
Blending Quadric Surfaces with Wuadric and Cubic Surfaces. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | B. K. Natarajan |
On Detecting the Orientation of Polygons and Polyhedra. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Subhash Suri |
The All-Geodesic-Furthest Neighbor Problem for Simple Polygons. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Joseph S. B. Mitchell, Christos H. Papadimitriou |
The Weighted Region Problem. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Alevizos, Jean-Daniel Boissonnat, Mariette Yvinec |
An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Francis Avnaim, Jean-Daniel Boissonnat |
Simultaneous Containment of Several Polygons. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Art J. Schwartz, Charles Stanton |
Analyzing Surfaces: The Truth About Elimination Theory. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | David Avis, Rephael Wenger |
Algorithms for Line Transversals in Space. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | D. Soule (eds.) |
Proceedings of the Third Annual Symposium on Computational Geometry, Waterloo, Ontario, Canada, June 8-10, 1987 |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | David Rappaport |
Computing Simple Circuits from a Set of Line Segments is NP-Complete. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Leonidas J. Guibas, John Hershberger 0001 |
Optimal Shortest Path Queries in a Simple Polygon. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Robert L. (Scot) Drysdale III, Robert B. Jerard |
Discrete Simulation of NC Machining. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | David G. Kirkpatrick |
Establishing Order in Planar Subdivisions. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Cao An Wang, Lenhart K. Schubert |
An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Boris Aronov |
On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. |
SCG |
1987 |
DBLP DOI BibTeX RDF |
|
1 | Bernard Chazelle, Herbert Edelsbrunner |
Linear Data Structures for Two Types of Range Search. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Mikhail J. Atallah, Michael T. Goodrich |
Efficient Plane Sweeping in Parallel. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Walter Whiteley |
Two Algorithms for Polyhedral Pictures. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Rex A. Dwyer |
A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Ferenc Dévai |
Quadratic Bounds for Hidden Line Elimination. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Leonidas J. Guibas, John Hershberger 0001, Daniel Leven, Micha Sharir, Robert Endre Tarjan |
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | David Avis, Hossam A. ElGindy |
Triangulating Simplicial Point Sets in Space. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | D. A. Field |
Implementing Watson's Algorithm in Three Dimensions. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Andrzej Lingas |
On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Leonidas J. Guibas, Raimund Seidel |
Computing Convolutions by Reciprocal Search. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | David Haussler, Emo Welzl |
Epsilon-Nets and Simplex Range Queries. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Paul Chew |
There is a Planar Graph Almost as Good as the Complete Graph. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Micha Sharir, Avikam Baltsan |
On Shortest Paths Amidst Convex Polyhedra. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Henry Crapo, Juliette Ryan |
Scene Analysis and Geometric Homology. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Shmuel Sifrony, Micha Sharir |
A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Cao An Wang, Edward P. F. Chan |
Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Gopalakrishnan Vijayan |
Geometry of Planar Graphs with Angles. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Christos Levcopoulos |
Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber |
Geometric Applications of a Matrix Searching Algorithm. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Steven Fortune |
A Sweepline Algorithm for Voronoi Diagrams. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | David Rappaport, Hiroshi Imai, Godfried T. Toussaint |
On Computing Simple Circuits on a Set of Line Segments. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Daniel Boissonnat, Monique Teillaud |
The Hierarchical Representation of Objects: The Delaunay Tree. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Rajeev Motwani 0001, Prabhakar Raghavan |
Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Wei-pang Chin, Simeon C. Ntafos |
Optimum Watchman Routes. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Dayong Zhang, Adrian Bowyer |
CSG Set-Theoretic Solid Modelling and NC Machining of Blend Aurfaces. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood |
Optimal Dynamic Solutions for Fixed Windowing Problems. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Per-Olof Fjällström |
Smoothing of Polyhedral Hodels. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Dan E. Willard |
On the Application of Shared Retrieval to Orthogonal Range Queries. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | V. Visvanathan, Linda S. Milor |
An Efficient Algorithm to Determine the Image of a Parallelepiped Under a Linear Transformation. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
LINPACK |
1 | J. Mark Keil |
Minimally Covering a Horizontally Convex Orthogonal Polygon. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | Subhash Suri, Joseph O'Rourke |
Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | A. H. Schoen |
A Defect-Correction algorithm for Minimizing the Volume of a Simple Polyhedron Which Circumscribes a Sphere. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
1 | David M. Mount |
Storing the Subdivision of a Polyhedral Surface. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|