Search results for "SCG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	David Avis, Komei Fukuda	A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.	SCG	1991	DBLP DOI BibTeX RDF
1	Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger	Minimum-Link Paths Among Obstacles in the Plane.	SCG	1990	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl	Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.	SCG	1990	DBLP DOI BibTeX RDF
1	Michael T. Goodrich, Steven B. Shauck, Sumanta Guha	Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version).	SCG	1990	DBLP DOI BibTeX RDF
1	A. Knight, J. May, Jeff McAffer, T. Nguyen, Jörg-Rüdiger Sack	A Computational geometry Workbench.	SCG	1990	DBLP DOI BibTeX RDF
1	Bernard Chazelle, Micha Sharir, Emo Welzl	Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems.	SCG	1990	DBLP DOI BibTeX RDF
1	Jirí Matousek 0001, Raimund Seidel, Emo Welzl	How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces.	SCG	1990	DBLP DOI BibTeX RDF
1	John F. Canny, Ashutosh Rege, John H. Reif	An Exact Algorithm for Kinodynamic Planning in the Plane.	SCG	1990	DBLP DOI BibTeX RDF
1	Bruce Randall Donald, Patrick G. Xavier	Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators.	SCG	1990	DBLP DOI BibTeX RDF
1	Helmut Alt, Rudolf Fleischer, Michael Kaufmann 0001, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig	Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.	SCG	1990	DBLP DOI BibTeX RDF
1	Timothy Law Snyder	On Minimal Rectilinear Steiner Trees in All Dimensions.	SCG	1990	DBLP DOI BibTeX RDF
1	Peter Gritzmann, Victor Klee, John Westwater	On the Limited Power of Linear Probes and Other Optimization Oracles.	SCG	1990	DBLP DOI BibTeX RDF
1	Steven Skiena, Warren D. Smith, Paul Lemke	Reconstructing Sets from Interpoint Distances (Extended Abstract).	SCG	1990	DBLP DOI BibTeX RDF
1	Daniel Bienstock	Some Provably Hard Crossing Number Problems.	SCG	1990	DBLP DOI BibTeX RDF
1	Chandrajit L. Bajaj	Geometric Computations with Algebraic Varieties of Bounded Degree.	SCG	1990	DBLP DOI BibTeX RDF
1	Raimund Seidel	Linear Programming and Convex Hulls Made Easy.	SCG	1990	DBLP DOI BibTeX RDF
1	David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan	Polygon Triangulation in O(n log log n) Time with Simple Data-Structures.	SCG	1990	DBLP DOI BibTeX RDF
1	Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger	The Combinatorial Complexity of Hyperplane Transversals.	SCG	1990	DBLP DOI BibTeX RDF
1	Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama	Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams.	SCG	1990	DBLP DOI BibTeX RDF
1	Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger 0001, Raimund Seidel, Micha Sharir	Slimming Down by Adding: Selecting Heavily Covered Points.	SCG	1990	DBLP DOI BibTeX RDF
1	Jindong Chen, Yijie Han	Shortest Paths on a Polyhedron.	SCG	1990	DBLP DOI BibTeX RDF
1	Mark H. Overmars, Micha Sharir	Merging Visibility Maps.	SCG	1990	DBLP DOI BibTeX RDF
1	Elefterios A. Melissaratos, Diane L. Souvaine	On Solving Geometric Optimization Problems Using Shortest Paths.	SCG	1990	DBLP DOI BibTeX RDF
1	Paul J. Heffernan, Joseph S. B. Mitchell	Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract).	SCG	1990	DBLP DOI BibTeX RDF
1	Gert Vegter, Chee-Keng Yap	Computational Complexity of Combinatorial Surfaces.	SCG	1990	DBLP DOI BibTeX RDF
1	Jirí Matousek 0001	Cutting Hyperplane Arrangements.	SCG	1990	DBLP DOI BibTeX RDF
1	Daniel P. Huttenlocher, Klara Kedem	Computing the Minimum Hausdorff Distance for Point Sets Under Translation.	SCG	1990	DBLP DOI BibTeX RDF
1	Zhenyu Li, Victor Milenkovic	Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic.	SCG	1990	DBLP DOI BibTeX RDF
1	Danièle Beauquier, Maurice Nivat	Tiling the Plane with One Tile.	SCG	1990	DBLP DOI BibTeX RDF
1	D. T. Lee, T. H. Chen, Chung-Do Yang	Shortest Rectilinear Paths among Weighted Obstacles.	SCG	1990	DBLP DOI BibTeX RDF
1	Raimund Seidel (eds.)	Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990	SCG	1990	DBLP DOI BibTeX RDF
1	Evangelos Kranakis, Michel Pocchiola	Enumeration and Visibility Problems in Integer Lattices (Extended Abstract).	SCG	1990	DBLP DOI BibTeX RDF
1	Jon Louis Bentley	K-d Trees for Semidynamic Point Sets.	SCG	1990	DBLP DOI BibTeX RDF	C++
1	Marco Pellegrini 0001	Stabbing and Ray Shooting in 3 Dimensional Space.	SCG	1990	DBLP DOI BibTeX RDF
1	János Pach, Gerhard J. Woeginger	Some New Bounds for Epsilon-Nets.	SCG	1990	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri	Selecting Distances in the Plane.	SCG	1990	DBLP DOI BibTeX RDF
1	Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger	Points and Triangles in the Plane and Halving Planes in Space.	SCG	1990	DBLP DOI BibTeX RDF
1	Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap	On Simultaneous Inner and Outer Approximation of Shapes.	SCG	1990	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch	An O(n2log n) Time Algorithm for the MinMax Angle Triangulation.	SCG	1990	DBLP DOI BibTeX RDF
1	B. K. Natarajan	On Computing the Intersection of B-Splines (Extended Abstract).	SCG	1990	DBLP DOI BibTeX RDF
1	Victor Milenkovic, Lee R. Nackman	Finding Compact Coordinate Representations for Polygons and Polyhedra.	SCG	1990	DBLP DOI BibTeX RDF
1	Jack Snoeyink	A Trivial Knot Whose Spanning Disks Have Exponential Size.	SCG	1990	DBLP DOI BibTeX RDF
1	Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri	On the Optimal Bisection of a Polygon (Extended Abstract).	SCG	1990	DBLP DOI BibTeX RDF
1	Mike Paterson, F. Frances Yao	Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling.	SCG	1989	DBLP DOI BibTeX RDF
1	Jim Ruppert, Raimund Seidel	On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra.	SCG	1989	DBLP DOI BibTeX RDF
1	Mikhail J. Atallah, Danny Z. Chen	Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point.	SCG	1989	DBLP DOI BibTeX RDF
1	Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri	Fining k Points with Minimum Spanning Trees and Related Problems.	SCG	1989	DBLP DOI BibTeX RDF
1	Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber	Fast Geometric Approximation Techniques and Geometric Embedding Problems.	SCG	1989	DBLP DOI BibTeX RDF
1	Peter Egyed, Rephael Wenger	Stabbing Pairwise Disjoint Translates in Linear Time.	SCG	1989	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	A Fast Planar Partition Algorithm, II.	SCG	1989	DBLP DOI BibTeX RDF
1	Rex A. Dwyer	Higher-Dimensional Voronoi Diagrams in Linear Expected Time.	SCG	1989	DBLP DOI BibTeX RDF
1	Shreeram S. Abhyankar, Srinivasan Chandrasekar, Vijaya Chandru	Degree Complexity Bounds on the Intersection of Algebraic Curves.	SCG	1989	DBLP DOI BibTeX RDF
1	Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint	Determining Sector Visibility of a Polygon.	SCG	1989	DBLP DOI BibTeX RDF
1	Jirí Matousek 0001, Emo Welzl	Good Splitters for Counting Points in Triangles.	SCG	1989	DBLP DOI BibTeX RDF
1	Mikhail J. Atallah, Jyh-Jong Tsay	On the Parallel Decomposability of Geometric Problems.	SCG	1989	DBLP DOI BibTeX RDF
1	L. Paul Chew, Klara Kedem	Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles.	SCG	1989	DBLP DOI BibTeX RDF
1	Pascal Lienhardt	Subdivisions of n-Dimensional Spaces and n-Dimensional Generalized Maps.	SCG	1989	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal	Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number.	SCG	1989	DBLP DOI BibTeX RDF
1	John Hershberger 0001, Subhash Suri	Finding Tailored Partitions.	SCG	1989	DBLP DOI BibTeX RDF
1	Joseph O'Rourke, Catherine A. Schevon	Computing the Geodesic Diameter of a 3-Polytope.	SCG	1989	DBLP DOI BibTeX RDF
1	Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis	Area Requirement and Symmetry Display in Drawing Graphs.	SCG	1989	DBLP DOI BibTeX RDF
1	Victor Milenkovic	Calculating Approximate Curve Arrangements Using Rounded Arithmetic.	SCG	1989	DBLP DOI BibTeX RDF
1	Imre Bárány, Zoltán Füredi, László Lovász 0001	On the Number of Halving Planes.	SCG	1989	DBLP DOI BibTeX RDF
1	Erich L. Kaltofen	Computing the Irreducible Real Factors and Components of an Algebraic Curve.	SCG	1989	DBLP DOI BibTeX RDF
1	Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang	Bounded-Diameter Minimum Spanning Trees and Related Problems.	SCG	1989	DBLP DOI BibTeX RDF
1	Odile Marcotte, Subhash Suri	On Geometric Matching.	SCG	1989	DBLP DOI BibTeX RDF
1	Peter W. Shor, Christopher J. Van Wyk	Detecting and Decomposing Self-Overlapping Curves.	SCG	1989	DBLP DOI BibTeX RDF
1	Richard Pollack, Rephael Wenger	Necessary and Sufficient Conditions for Hyperplane Transversals.	SCG	1989	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner	An Acyclicity Theorem for Cell Complexes in d Dimensions.	SCG	1989	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal	A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application.	SCG	1989	DBLP DOI BibTeX RDF
1	Chandrajit L. Bajaj, Insung Ihm	Hermite Interpolation of Rational Space Curves Using Real Algebraic Surfaces.	SCG	1989	DBLP DOI BibTeX RDF
1	Jirí Matousek 0001	Construction of epsilon Nets.	SCG	1989	DBLP DOI BibTeX RDF
1	Bernard Chazelle, Leonidas Palios	Triangulating a Non-Convex Polytype.	SCG	1989	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Robert Connelly, Joseph S. B. Mitchell	On Monotone Paths Among Obstacles with Applications to Planning Assemblies.	SCG	1989	DBLP DOI BibTeX RDF
1	Bernard Chazelle, Burton Rosenberg	Computing Partial Sums in Multidimensional Arrays.	SCG	1989	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Mariette Yvinec	Probing a Scene of Non Convex Polyhedra.	SCG	1989	DBLP DOI BibTeX RDF
1	David Salesin, Jorge Stolfi, Leonidas J. Guibas	Epsilon Geometry: Building Robust Algorithms from Imprecise Computations.	SCG	1989	DBLP DOI BibTeX RDF
1	Joseph Friedman, John Hershberger 0001, Jack Snoeyink	Compliant Motion in a Simple Polygon.	SCG	1989	DBLP DOI BibTeX RDF
1	W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee	Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time.	SCG	1989	DBLP DOI BibTeX RDF
1	Yan Ke	An Efficient Algorithm for Link-Distance Problems.	SCG	1989	DBLP DOI BibTeX RDF
1	Amy J. Briggs	An Efficient Algorithm for One-Step Planar Complaint Motion Planning with Uncertainty.	SCG	1989	DBLP DOI BibTeX RDF
1	Keiko Imai, S. Sumino, Hiroshi Imai	Minimax Geometric Fitting of Two Corresponding Sets of Points.	SCG	1989	DBLP DOI BibTeX RDF
1	Gert Vegter	Kink-Free Deformations of Polygons.	SCG	1989	DBLP DOI BibTeX RDF
1	Jack Snoeyink, John Hershberger 0001	Sweeping Arrangements of Curves.	SCG	1989	DBLP DOI BibTeX RDF
1	Dan Halperin, Mark H. Overmars	Efficient Motion Planning for an L-Shaped Object.	SCG	1989	DBLP DOI BibTeX RDF
1	Erik Brisson	Representing Geometric Structures in d Dimensions: Topology and Order.	SCG	1989	DBLP DOI BibTeX RDF
1	Kurt Mehlhorn (eds.)	Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989	SCG	1989	DBLP DOI BibTeX RDF
1	Boris Aronov, Micha Sharir	Triangles in Space or Building (and Analyzing) Castles in the Air.	SCG	1988	DBLP DOI BibTeX RDF
1	Gordon T. Wilfong	Motion Planning in the Presence of Movable Obstacles.	SCG	1988	DBLP DOI BibTeX RDF
1	Dan E. Willard, Young C. Wee	Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems.	SCG	1988	DBLP DOI BibTeX RDF
1	Marshall W. Bern	Hidden Surface Removal for Rectangles.	SCG	1988	DBLP DOI BibTeX RDF
1	Chee-Keng Yap	A Geometric Consistency Theorem for a Symbolic Perturbation Scheme.	SCG	1988	DBLP DOI BibTeX RDF
1	David M. Mount, Alan Saalfeld	Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time.	SCG	1988	DBLP DOI BibTeX RDF
1	Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao	Clustering Algorithms Based on Minimum and Maximum Spanning Trees.	SCG	1988	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger 0001, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink	On Arrangements of Jordan Arcs with Three Intersections per Pair.	SCG	1988	DBLP DOI BibTeX RDF
1	Laxmi P. Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos	Path Planning in 0/1/infinity Weighted Regions with Applications.	SCG	1988	DBLP DOI BibTeX RDF
1	Mark H. Overmars, Emo Welzl	New Methods for Computing Visibility Graphs.	SCG	1988	DBLP DOI BibTeX RDF
1	David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars	Searching for Empty Convex Polygons.	SCG	1988	DBLP DOI BibTeX RDF
1	Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick	Towards Implementing Robust Geometric Computations.	SCG	1988	DBLP DOI BibTeX RDF
1	Emo Welzl	Partition Trees for Triangle Counting and Other Range Searching Problems.	SCG	1988	DBLP DOI BibTeX RDF

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