Raimund Seidel

Eleni Tzanaki

Comput. Geom., 2013

A simple aggregative algorithm for counting triangulations of planar point sets and related problems.

[BibT_eX]

[DOI]

Victor Alvarez

Proceedings of the Symposium on Computational Geometry 2013, 2013

Counting Triangulations Approximately.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Determining an Aesthetic Inscribed Curve.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Computational Aesthetics in Graphics, 2012

2011

Can Nearest Neighbor Searching Be Simple and Always Fast?

[BibT_eX]

[DOI]

Victor Alvarez

Proceedings of the Algorithms - ESA 2011, 2011

2010

Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric.

[BibT_eX]

[DOI]

Victor Alvarez

Comput. Geom., 2010

Data-Specific Analysis of String Sorting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

10091 Abstracts Collection - Data Structures.

[BibT_eX]

[DOI]

Lars Arge

Erik D. Demaine

Proceedings of the Data Structures, 28.02. - 05.03.2010, 2010

2009

On the complexity of umbra and penumbra.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Teaching Computational Geometry, II.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Maintaining Ideally Distributed Random Search Trees without Extra Space.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

2008

Faires Teilen: Eine Weihnachtsstollengeschichte.

[BibT_eX]

[DOI]

Proceedings of the Taschenbuch der Algorithmen, 2008

Algorithm visualization using concrete and abstract shape graphs.

[BibT_eX]

[DOI]

Sascha A. Parduhn

Reinhard Wilhelm

Proceedings of the ACM 2008 Symposium on Software Visualization, 2008

08081 Abstracts Collection - Data Structures.

[BibT_eX]

[DOI]

Lars Arge

Robert Sedgewick

Proceedings of the Data Structures, 17.02. - 22.02.2008, 2008

2007

On Computing the Centroid of the Vertices of an Arrangement and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Between umbra and penumbra.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

On the Number of Cycles in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices.

[BibT_eX]

[DOI]

Khaled M. Elbassioni

Zvi Lotker

Inf. Process. Lett., 2006

Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

2005

Top-Down Analysis of Path Compression.

[BibT_eX]

[DOI]

Micha Sharir

SIAM J. Comput., 2005

Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices

[BibT_eX]

[DOI]

Khaled M. Elbassioni

Zvi Lotker

CoRR, 2005

Algorithm animation using shape analysis: visualising abstract executions.

[BibT_eX]

[DOI]

Dierk Johannes

Reinhard Wilhelm

Proceedings of the ACM 2005 Symposium on Software Visualization, 2005

Developments in Data Structure Research During the First 25 Years of FSTTCS.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

On the exact computation of the topology of real algebraic curves.

[BibT_eX]

[DOI]

Nicola Wolpert

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Convex Hull Computations.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2003

A better upper bound on the number of triangulations of a planar point set.

[BibT_eX]

[DOI]

Francisco Santos

J. Comb. Theory A, 2003

2002

Maximizing a Voronoi Region: The Convex Case.

[BibT_eX]

[DOI]

Frank K. H. A. Dehne

Rolf Klein

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Algorithm Explanation: Visualizing Abstract States and Invariants.

[BibT_eX]

[DOI]

Reinhard Wilhelm

Tomasz Müldner

Proceedings of the Software Visualization, 2001

1998

Guest Editor's Foreword.

[BibT_eX]

Discret. Comput. Geom., 1998

On the Number of Triangulations of Planar Point Sets.

[BibT_eX]

[DOI]

Comb., 1998

On the Exact Worst Case Query Complexity of Planar Point Location.

[BibT_eX]

[DOI]

Udo Adamy

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Results on <i>k</i>-Sets and <i>j</i>-Facets via Continuous Motion.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies.

[BibT_eX]

Jeff Erickson

Discret. Comput. Geom., 1997

How Good Are Convex Hull Algorithms?.

[BibT_eX]

[DOI]

David Avis

David Bremner

Comput. Geom., 1997

Efficient Perturbations for Handling Geometric Degeneracies.

[BibT_eX]

[DOI]

Ioannis Z. Emiris

John F. Canny

Algorithmica, 1997

1996

Checking Geometric Programs or Verification of Geometric Structures.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version.

[BibT_eX]

[DOI]

Comput. Geom., 1995

1994

Selecting Heavily Covered Points.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

The Nature and Meaning of Perturbations in Geometric Computing.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

1993

On Compatible Triangulations of Simple Polygons.

[BibT_eX]

[DOI]

Boris Aronov

Diane L. Souvaine

Comput. Geom., 1993

Better Lower Bounds on Detecting Affine and Spherical Degeneracies

[BibT_eX]

[DOI]

Jeff Erickson

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Teaching Computational Geometry.

[BibT_eX]

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.

[BibT_eX]

[DOI]

Jim Ruppert

Discret. Comput. Geom., 1992

On the All-Pairs-Shortest-Path Problem

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Four Results on Randomized Incremental Constructions.

[BibT_eX]

[DOI]

Kenneth L. Clarkson

Kurt Mehlhorn

Proceedings of the STACS 92, 1992

A Tail Estimate for Mulmuley's Segment Intersection Algorithm.

[BibT_eX]

[DOI]

Jirí Matousek

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

Small-Dimensional Linear Programming and Convex Hulls Made Easy.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1991

A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons.

[BibT_eX]

[DOI]

Comput. Geom., 1991

On the Zone Theorem for Hyperplane Arrangements.

[BibT_eX]

[DOI]

Micha Sharir

Proceedings of the New Results and New Trends in Computer Science, 1991

1990

Counting and Cutting Cycles of Lines and Rods in Space

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Exact Upper Bounds for the Number of Faces in d-Dimensional Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Linear Programming and Convex Hulls Made Easy.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces.

[BibT_eX]

[DOI]

Jirí Matousek

Emo Welzl

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Slimming Down by Adding: Selecting Heavily Covered Points.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

On Arrangement of Jordan Arcs with Three Intersection per Pair.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1989

Randomized Search Trees

[BibT_eX]

[DOI]

Cecilia R. Aragon

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra.

[BibT_eX]

[DOI]

Jim Ruppert

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Efficiently Computing And Representing Aspect Graphs Of Polyhedral Objects.

[BibT_eX]

[DOI]

Ziv Gigus

John F. Canny

Proceedings of the Second International Conference on Computer Vision, 1988

Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Implicitly Representing Arrangements of Lines or Segments.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

On Arrangements of Jordan Arcs with Three Intersections per Pair.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Output-Size Sensitive Algorithms For Constructive Problems In Computational Geometry.

[BibT_eX]

PhD thesis, 1987

On the Number of Faces in Higher-Dimensional Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

Computing the Link Center of a Simple Polygon.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Sue Whitesides

Chee-Keng Yap

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

The Ultimate Planar Convex Hull Algorithm?

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Computing Convolutions by Reciprocal Search.

[BibT_eX]

[DOI]

Leonidas J. Guibas

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Finding the optimal shadows of a convex polytope.

[BibT_eX]

[DOI]

Michael McKenna

Proceedings of the First Annual Symposium on Computational Geometry, 1985

Output-size sensitive algorithms for finding maximal vectors.

[BibT_eX]

[DOI]

Proceedings of the First Annual Symposium on Computational Geometry, 1985

Voronoi diagrams and arrangements.

[BibT_eX]

[DOI]

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Some methods of computational geometry applied to computer graphics.

[BibT_eX]

[DOI]

Mark H. Overmars

Comput. Vis. Graph. Image Process., 1984

1983

Constructing Arrangements of Lines and Hyperplanes with Applications

[BibT_eX]

[DOI]

Joseph O'Rourke

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1981

The Shape of a Set of Points in the Plane.

[BibT_eX]

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

A New Method for Solving Constraint Satisfaction Problems.

[BibT_eX]

[DOI]