Search results for "SCG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama	Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications.	SCG	1993	DBLP DOI BibTeX RDF
1	Marco Pellegrini 0001	On Lines Missing Polyhedral Sets in 3-Space.	SCG	1993	DBLP DOI BibTeX RDF
1	Paul J. Heffernan	An Optimal Algorithm for the Two-Guard Problem.	SCG	1993	DBLP DOI BibTeX RDF
1	John Hershberger 0001	Compliant Motion in a Simple Polygon.	SCG	1993	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena	Decision Trees for Geometric Models.	SCG	1993	DBLP DOI BibTeX RDF
1	Y. B. Karasik, Micha Sharir	The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry.	SCG	1993	DBLP DOI BibTeX RDF
1	A. Corbalan, Marisa Mazón, Tomás Recio, Francisco Santos	On the Topological Shape of Planar Voronoi Diagrams.	SCG	1993	DBLP DOI BibTeX RDF
1	Marshall W. Bern, David Eppstein	Worst-Case Bounds for Subadditive Geometric Graphs.	SCG	1993	DBLP DOI BibTeX RDF
1	Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin	Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers.	SCG	1993	DBLP DOI BibTeX RDF
1	Thomas Dubé	Dominance Range-Query: The One-Reporting Case.	SCG	1993	DBLP DOI BibTeX RDF
1	Michel Pocchiola, Gert Vegter	The Visibility Complex.	SCG	1993	DBLP DOI BibTeX RDF
1	Rolf Klein, Andrzej Lingas	A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon.	SCG	1993	DBLP DOI BibTeX RDF
1	Estarose Wolfson, Micha Sharir	Implementation of a Motion Planning System in Three Dimensions.	SCG	1993	DBLP DOI BibTeX RDF
1	David P. Dobkin, David Eppstein	Computing the Discrepancy.	SCG	1993	DBLP DOI BibTeX RDF
1	Michael B. Dillencourt, Warren D. Smith	A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra.	SCG	1992	DBLP DOI BibTeX RDF
1	Timothy Law Snyder, J. Michael Steele	A Priori Inequalities for the Euclidean Traveling Salesman.	SCG	1992	DBLP DOI BibTeX RDF
1	Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi	A Framework for Dynamic Graph Drawing.	SCG	1992	DBLP DOI BibTeX RDF
1	Haijo Schipper	Determining Contractibility of Curves.	SCG	1992	DBLP DOI BibTeX RDF
1	Azriel Rosenfeld	Digital Geometry (Abstract).	SCG	1992	DBLP BibTeX RDF
1	Jirí Matousek 0001	Range Searching with Efficient Hierarchical Cuttings.	SCG	1992	DBLP DOI BibTeX RDF
1	Boris Aronov, Micha Sharir	Castles in the Air Revisited.	SCG	1992	DBLP DOI BibTeX RDF
1	Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu	There is a Universal Topological Plane.	SCG	1992	DBLP DOI BibTeX RDF
1	David Avis (eds.)	Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992	SCG	1992	DBLP DOI BibTeX RDF
1	Ioannis Z. Emiris, John F. Canny	An Efficient Approach to Removing Geometric Degeneracies.	SCG	1992	DBLP DOI BibTeX RDF
1	Günter Rote	Degenerate Convex Hulls in High Dimensions without Extra Storage.	SCG	1992	DBLP DOI BibTeX RDF
1	Valeriu Soltan, Alexei Gorpinevich	Minimum Dissection of Rectilinear Polygon with Arbitrary Holes into Rectangles.	SCG	1992	DBLP DOI BibTeX RDF
1	Danny Z. Chen	An Optimal Parallel Algorithm for Detecting Weak Visibility of a Simple Polygon.	SCG	1992	DBLP DOI BibTeX RDF
1	Steven Fortune	Numerical Stability of Algorithms for 2D Delaunay Triangulations.	SCG	1992	DBLP DOI BibTeX RDF
1	Scott A. Mitchell, Stephen A. Vavasis	Quality Mesh Generation in Three Dimensions.	SCG	1992	DBLP DOI BibTeX RDF
1	Y. B. Karasik, Micha Sharir	Optical Computational Geometry.	SCG	1992	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata	Stable Placements for Spider Robots.	SCG	1992	DBLP DOI BibTeX RDF
1	Noga Alon, Daniel J. Kleitman	Piercing Convex Sets.	SCG	1992	DBLP DOI BibTeX RDF
1	Elefterios A. Melissaratos, Diane L. Souvaine	Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes.	SCG	1992	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner, Nimish R. Shah	Incremental Topological Flipping Works for Regular Triangulations.	SCG	1992	DBLP DOI BibTeX RDF
1	Jeffrey S. Salowe	On Euclidean Spanner Graphs with Small Degree.	SCG	1992	DBLP DOI BibTeX RDF
1	Paul J. Heffernan, Stefan Schirra	Approximate Decision Algorithms for Point Set Congruence.	SCG	1992	DBLP DOI BibTeX RDF
1	Rolf Klein, Andrzej Lingas	Manhattonian Proximity in a Simple Polygon.	SCG	1992	DBLP DOI BibTeX RDF
1	Naoki Katoh, Kazuo Iwano	Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane.	SCG	1992	DBLP DOI BibTeX RDF
1	Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg	On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets Under Euclidean Motion in the Plane.	SCG	1992	DBLP DOI BibTeX RDF
1	Christian Schwarz 0002, Michiel H. M. Smid, Jack Snoeyink	An Optimal Algorithm for the On-Line Closest-Pair Problem.	SCG	1992	DBLP DOI BibTeX RDF
1	John F. Canny, Bruce Randall Donald, Eugene K. Ressler	A Rational Rotation Method for Robust Geometric Algorithms.	SCG	1992	DBLP DOI BibTeX RDF
1	Noga Alon, Yossi Azar	On-Line Steiner Trees in the Euclidean Plane.	SCG	1992	DBLP DOI BibTeX RDF
1	Hervé Brönnimann, Bernard Chazelle	How Hard is Halfspace Range Searching?	SCG	1992	DBLP DOI BibTeX RDF
1	Jirí Matousek 0001, Micha Sharir, Emo Welzl	A Subexponential Bound for Linear Programming.	SCG	1992	DBLP DOI BibTeX RDF	computational geometry, linear programming, combinatorial optimization, randomized incremental algorithms
1	Helmut Alt, Michael Godau	Measuring the Resemblance of Polygonal Curves.	SCG	1992	DBLP DOI BibTeX RDF
1	Marco Pellegrini 0001	Incidence and Nearest-Neighbor Problems for Lines in 3-Space.	SCG	1992	DBLP DOI BibTeX RDF
1	Martin E. Dyer	A Class of Convex Programs with Applications to Computational Geometry.	SCG	1992	DBLP DOI BibTeX RDF
1	Barun Chandra, Gautam Das 0001, Giri Narasimhan, José Soares	New Sparseness Results on Graph Spanners.	SCG	1992	DBLP DOI BibTeX RDF
1	Otfried Schwarzkopf	Ray Shooting in Convex Polytopes.	SCG	1992	DBLP DOI BibTeX RDF
1	John Hershberger 0001	Optimal Parallel Algorithms for Triangulated Simple Polygons.	SCG	1992	DBLP DOI BibTeX RDF
1	Alexander I. Barvinok	Computing the Volume, Counting Integral Points, and Exponential Sums.	SCG	1992	DBLP DOI BibTeX RDF
1	Marshall W. Bern, David P. Dobkin, David Eppstein	Triangulating Polygons without Large Angles.	SCG	1992	DBLP DOI BibTeX RDF
1	David M. Mount	Intersection Detection and Separators for Simple Polygons.	SCG	1992	DBLP DOI BibTeX RDF
1	Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf	Computing and Verifying Depth Orders.	SCG	1992	DBLP DOI BibTeX RDF
1	Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov	Minkowski-Type Theorems and Least-Squares Partitioning.	SCG	1992	DBLP DOI BibTeX RDF
1	Jirí Matousek 0001, Otfried Schwarzkopf	Linear Optimization Queries.	SCG	1992	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner, Tiow Seng Tan	An Upper Bound for Conforming Delaunay Triangulations.	SCG	1992	DBLP DOI BibTeX RDF
1	Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir	Diameter, Width, Closest Line Pair, and Parametric Searching.	SCG	1992	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor	Arrangements of Segments that Share Endpoints: Single Face Results.	SCG	1991	DBLP DOI BibTeX RDF
1	Robert L. Scot Drysdale (eds.)	Proceedings of the Seventh Annual Symposium on Computational Geometry, North Conway, NH, USA, , June 10-12, 1991	SCG	1991	DBLP DOI BibTeX RDF
1	Christian Icking, Rolf Klein	The Two Guards Problem.	SCG	1991	DBLP DOI BibTeX RDF
1	Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama	Walking on an Arrangement Topologically.	SCG	1991	DBLP DOI BibTeX RDF
1	Daniel P. Huttenlocher, Klara Kedem, Micha Sharir	The Upper Envelope of Voronoi Surfaces and Its Applications.	SCG	1991	DBLP DOI BibTeX RDF
1	Michael Formann, Frank Wagner 0001	A Packing Problem with Applications to Lettering of Maps.	SCG	1991	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars	Intersection Queries for Curved Objects (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Jirí Matousek 0001	Efficient Partition Trees.	SCG	1991	DBLP DOI BibTeX RDF
1	Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman	Crossing Families.	SCG	1991	DBLP DOI BibTeX RDF
1	Sivan Toledo	Extremal Polygon Containment Problems.	SCG	1991	DBLP DOI BibTeX RDF
1	Claire Kenyon, Richard W. Kenyon	How to Take Short Cuts.	SCG	1991	DBLP DOI BibTeX RDF
1	Steven Fortune, Victor Milenkovic	Numerical Stability of Algorithms for Line Arrangements.	SCG	1991	DBLP DOI BibTeX RDF
1	Matthew J. Katz, Mark H. Overmars, Micha Sharir	Efficient Hidden Surface Removal for Objects with small Union Size.	SCG	1991	DBLP DOI BibTeX RDF
1	Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert 0001	Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Micha Sharir	Counting Circular Arc Intersections.	SCG	1991	DBLP DOI BibTeX RDF
1	Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson	Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Gordon T. Wilfong	Nearest Neighbor Problems.	SCG	1991	DBLP DOI BibTeX RDF
1	V. T. Rajan	Optimality of the Delaunay Triangulation in Rd.	SCG	1991	DBLP DOI BibTeX RDF
1	Marshall W. Bern, David Eppstein	Polynomial-Size Nonobtuse Triangulation of Polygons.	SCG	1991	DBLP DOI BibTeX RDF
1	Takeshi Tokuyama, Jun Nakano	Geometric Algorithms for a Minimum Cost Assignment Problem.	SCG	1991	DBLP DOI BibTeX RDF
1	Tamal K. Dey	Triangulation and CSG Representation of Polyhedra with Arbitrary Genus.	SCG	1991	DBLP DOI BibTeX RDF
1	Ketan Mulmuley, Sandeep Sen	Dynamic Point Location in Arrangements of Hyperplanes.	SCG	1991	DBLP DOI BibTeX RDF
1	Antal Balog, Imre Bárány	On the Convex Hull of the Integer Points in a Disc.	SCG	1991	DBLP DOI BibTeX RDF
1	Dan Halperin	On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Matthew Dickerson, Robert L. (Scot) Drysdale III	Enumerating k Distances for n Points in the Plane.	SCG	1991	DBLP DOI BibTeX RDF
1	Helmut Alt, Bernd Behrends, Johannes Blömer	Approximate Matching of Polygonal Shapes (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Jeffrey S. Salowe	Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees.	SCG	1991	DBLP DOI BibTeX RDF
1	Boris Aronov, Joseph O'Rourke	Nonoverlap of the Star Unfolding.	SCG	1991	DBLP DOI BibTeX RDF
1	H. S. M. Coxeter	Orthogonal Trees.	SCG	1991	DBLP DOI BibTeX RDF
1	Clyde L. Monma, Subhash Suri	Transitions in Geometric Minimum Spanning Trees (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Kenneth L. Clarkson, Richard Cole 0001, Robert Endre Tarjan	Randomized Parallel Algorithms for Trapezoidal Diagrams.	SCG	1991	DBLP DOI BibTeX RDF
1	Collette R. Coullard, Anna Lubiw	Distance Visibility Graphs.	SCG	1991	DBLP DOI BibTeX RDF
1	Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia	Computing Shortest Transversals of Sets (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Yi-Jen Chiang, Roberto Tamassia	Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Franz Aurenhammer, Otfried Schwarzkopf	A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams.	SCG	1991	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces.	SCG	1991	DBLP DOI BibTeX RDF
1	Barry Schaudt, Robert L. (Scot) Drysdale III	Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Boris Aronov, Jirí Matousek 0001, Micha Sharir	On the Sum of Squares of Cell Complexities in Hyperplane Arrangements.	SCG	1991	DBLP DOI BibTeX RDF
1	Paola Bertolazzi, Giuseppe Di Battista	On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract).	SCG	1991	DBLP DOI BibTeX RDF
1	Frank Morgan	Minimal Surfaces, Crystals, and Norms on Rn.	SCG	1991	DBLP DOI BibTeX RDF
1	Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld	Efficient Ray Shooting and Hidden Surface Removal.	SCG	1991	DBLP DOI BibTeX RDF

Publications at "SCG"( http://dblp.L3S.de/Venues/SCG )