Discret. Comput. Geom

277 papers175 directions

Papers by Year

2026 9
2025 7
2024 14
2023 14
2022 17
2021 18
2020 21
2019 10
2018 6
2017 13
2016 8
2015 11
2014 5
2013 9
2012 8
2011 14
2010 8
2009 9
2008 8
2007 5
2006 6
2005 6
2004 9
2003 8
2002 3
2001 5
2000 7
1999 4
1998 2
1997 2
1996 2
1995 4
1994 3
1993 5
1992 2
1991 4
1990 4
1989 13
1988 2
1987 2
1986 1

Top Research Directions

Research directions most represented by papers from this venue.

Scaling Topological Data Analysis for Deep Learning 13
Geometric Duality Transformations for Spatial Optimization 10
Handling Geometric Degeneracies via Symbolic Perturbation 10
Kinetic Maintenance of Dynamic Geometric Structures 9
Hierarchical Spatial Partitioning 6
The Empirical Validation Gap 6
Linearizing Geometric Constraints Through Dimensionality Lifting 5
Tracking Structural Features with Persistent Homology 5
Mitigating Aspect Ratio Sensitivity in Geometric Algorithms 4
The Computational Complexity of Tropical Geometry 4
Closing Distortion Gaps in Planar Metric Embeddings 4
Geometric Visibility in Multiply Connected Domains 4
The Representation Gap in Multiparameter Persistent Homology 4
Managing Hidden Constant Overhead in Algorithm Design 4
The Challenge of Higher Dimensional Generalization 4

Top Authors

AuthorPapers
Haim Kaplan11
Kenneth L. Clarkson11
Haitao Wang8
Michael Kerber7
Steven J. Gortler7
Arijit Ghosh6
Steve Oudot6
Yusu Wang6
David Cohen-Steiner5
Gennadiy Averkov5
Jean B. Lasserre5
Herbert Edelsbrunner4
Kurt Mehlhorn4
Pankaj K Agarwal4
Anupam Gupta3
Dmitriy Morozov3
Meirav Zehavi3
Noga Alon3
Patrick Schnider3
Quentin Mérigot3

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Metric Embeddings--Beyond One-Dimensional Distortion2004
Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions2004
Shape Dimension and Intrinsic Metric from Samples of Manifolds2004
Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions2004
Testing Homotopy for Paths in the Plane2004
The Integer Hull of a Convex Rational Polytope2004
Discrete Mobile Centers2003
Expressing the box cone radius in the relational calculus with real polynomial constraints2003
In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions2003
Reconstruction of Convex Bodies from Brightness Functions2003
Segment Intersection Searching Problems in General Settings2003
Shape Dimension and Approximation from Samples2003
Spanning Trees Crossing Few Barriers2003
Substitution Delone Sets2003
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping2002
The Number of Congruent Simplices in a Point Set2002
Visibility Queries and Maintenance in Simple Polygons2002
Every Set of Disjoint Line Segments Admits a Binary Tree2001
Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells2001
Kinetic Connectivity for Unit Disks2001
Maintaining the Extent of a Moving Point Set2001
On the Complexity of Arrangements of Circles in the Plane2001
A Central Limit Theorem for Convex Chains in the Square2000
Curve Reconstruction, the Traveling Salesman Problem, and Menger's Theorem on Length2000
Efficient Algorithms for Approximating Polygonal Chains2000
Embedding Tree Metrics into Low-Dimensional Euclidean Spaces2000
Lower Bounds for Kinetic Planar Subdivisions2000
Morphing Simple Polygons2000
Regression Depth and Center Points2000
Guest Editor's Foreword1999
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions1999
Motion Planning for a Convex Polygon in a Polygonal Environment1999
Nearest Neighbor Queries in Metric Spaces1999
Largest Placement of One Convex Polygon Inside Another1998
Piercing d -Intervals1998
On Conway's Thrackle Conjecture1997
The Overlay of Lower Envelopes and Its Applications1996
Vertical Decompositions for Triangles in 3-Space1996
Bounding the Piercing Number1995
Improved Bounds on Weak epsilon-Nets for Convex Sets1995
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions1995
Can Visibility Graphs Be Represented Compactly?1994
On Range Searching with Semialgebraic Sets1994
On the Number of Views of Polyhedral Terrains1994
A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem1993
Applications of a New Space-Partitioning Technique1993
Diameter, Width, Closest Line Pair, and Parametric Searching1993
Minimum Steiner Trees in Normed Planes1993
On-Line Steine Trees in the Euclidean Plane1993
Counting Facets and Incidences1992

« prev Page 5/6 next »