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
Tiling Polygons with Parallelograms1992
Bisectors of Linearly Separable Sets1991
On the Construction of Abstract Voronoi Diagrams1991
Points and Triangles in the Plane and Halving Planes in Space1991
Theorems on the Existence of Separating Surfaces1991
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres1990
Partitioning Arrangements of Lines I: An Efficient deterministic Algorithm1990
The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments1990
The Complexity of Many Cells in Arrangements of Planes and Related Problems1990
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon1989
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon1989
Application of Random Sampling in Computational Geometry, II1989
Cutting Disjoint Disks by Straight Lines1989
Disjoint Edges in Geometric Graphs1989
Geometric Optimization and Dp - Completeness1989
Implicitly Representing Arrangements of Lines or Segments1989
On Arrangement of Jordan Arcs with Three Intersection per Pair1989
On the General Motion-Planning Problem with Two Degrees of Freedom1989
The Complexity of Cutting Complexes1989
The Maximum Size of a Convex Polygon in a Restricted Set in the Plane1989
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications1989
Visibility and Intersection Problems in Plane Geometry1989
Congruence, Similarity, and Symmetries of Geometric Objects1988
The Algebraic Degree of Geometric Optimization Problems1988
Computing Convolutions by Reciprocal Search1987
New Applications of random Sampling in Computational Geometry1987
Covering a Square by Small Perimeter Rectangles1986

« prev Page 6/6