yusuke1997/dblp-id-title huggingface dataset:
An improved bound on the number of unit area triangles
Three problems about dynamic convex hulls
A Priori Inequalities for the Euclidean Traveling Salesman
Approximate convex decomposition of polygons
A Package for Triangulations
Computing the Minimum Hausdorff Distance for Point Sets Under Translation
On the Number of Arrangements of Pseudolines
Happy endings for flip graphs
Maximum Volume Subset Selection for Anchored Boxes
Enumerating k Distances for n Points in the Plane
A computational geometry approach to clustering problems
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions
Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach (Media Exposition)
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
A General Method for Partial Point Set Matching
On s -intersecting curves and related problems
Outerstring graphs are χ-bounded
Declutter and Resample: Towards Parameter Free Denoising
Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)
Approximate Nearest-Neighbor Search for Line Segments
Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips)
Optimal robot localization in trees
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region
Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009
Shape approximation using k-order alpha-hulls
Tetrahedral Mesh Generation by Delaunay Refinement
Improving the first selection lemma in R 3
Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect
Algorithms for two-box covering
Progressive Geometric Algorithms
A Near-Linear Time Approximation Scheme for Geometric Transportation with Arbitrary Supplies and Spread
Animation of curve constrained drawings of planar graphs
Testing the congruence of d-dimensional point sets
Geometric Applications of a Matrix Searching Algorithm
On Euclidean Spanner Graphs with Small Degree
An energy-driven approach to linkage unfolding
A Spectral Gap Precludes Low-Dimensional Embeddings
New constructions of weak epsilon-nets
Subquadratic Algorithms for Algebraic Generalizations of 3SUM
Stabbing Triangulations by Lines in 3D
Sliver removal by lattice refinement
On β-Plurality Points in Spatial Voting Games
Capture bounds for visibility-based pursuit evasion
Zigzag persistent homology in matrix multiplication time
Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions
Delaunay triangulations of imprecise pointsin linear time after preprocessing
A Solution to Ringel's Circle Problem
Voronoi Diagrams for Direction-Sensitive Distances
Faster Algorithms for Largest Empty Rectangles and Boxes
Recognizing Weakly Simple Polygons
On the Complexity of the Union of Fat Objects in the Plane
Computational Aspects of the Colorful Carathéodory Theorem
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class
Curve Reconstruction, the Traveling Salesman Problem and Menger's Theorem on Length
On the least median square problem
Computational geometry for sculpture
Fitting a Set of Points by a Circle
An Exact Algorithm for Kinodynamic Planning in the Plane
Random Walks on Polytopes of Constant Corank
Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers
Toroidal Coordinates: Decorrelating Circular Coordinates with Lattice Reduction
Rectilinear shortest paths with rectangular barriers
Minimal Surfaces, Crystals, and Norms on R n
Maximum thick paths in static and dynamic environments
How to walk your dog in the mountains with no magic leash
Computational Complexity of the Interleaving Distance
Bounding Radon Number via Betti Numbers
Approximate Range Counting Revisited
On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs
On Bisectors for Different Distance Functions
Connecting the Dots (with Minimum Crossings)
Combinatorial Resultants in the Algebraic Rigidity Matroid
On the Number of Digons in Arrangements of Pairwise Intersecting Circles
A Triangulation-Based Object Reconstruction Method
3DTreeDraw: a thjree dimensional tree drawing system
On Expansion and Topological Overlap
Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles
Trajectory Grouping Structure under Geodesic Distance
Visualization of Geometric Spanner Algorithms
The Z_2-Genus of Kuratowski Minors
Efficient Breakout Routing in Printed Circuit Boards
The Tight Lower Bound for the Steiner Ratio in Minkowski Planes
Tight Bounds for the Learning of Homotopy à la Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds
An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems
A Complete Roundness Classification Procedure
A randomized art-gallery algorithm for sensor placement
I/O-efficient dynamic planar point location (extended abstract)
Error Bounded Regular Algebraic Spline Curves
Cutting Dense Point Sets in Half
Efficient algorithms for shared camera control
Computing Geomorphologically Salient Networks via Discrete Morse Theory
Persistent cohomology and circular coordinates
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
On Triangulating Three-Dimensional Polygons
Induced Matchings of Barcodes and the Algebraic Stability of Persistence
Discrete differential forms and applications to surface tiling
New results on shortest paths in three dimensions
A Note on Relative Neighborhood Graphs
Arrangements of Lines in 3-Space: A Data Structure with Applications
Geometric Matching and Bottleneck Problems
The orienteering problem in the plane revisited
Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications
Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs
Triangulating a Non-Convex Polytype
Efficient Randomized Algorithms for Some Geometric Optimization Problems
Geometric Applications of a Randomized Optimization Technique
Finding a curve in a map
The theory of multidimensional persistence
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006
Cache-oblivious r-trees
An (ℵ₀, k+2)-Theorem for k-Transversals
On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract)
Iterated snap rounding with bounded drift
On Computability and Triviality of Well Groups
Sampling with Removal in LP-type Problems
A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
Delaunay Triangulations on Orientable Surfaces of Low Genus
Computing closed essential surfaces in knot complements
Calculating Approximate Curve Arrangements Using Rounded Arithmetic
Lenses in arrangements of pseudo-circles and their applications
Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach
Efficient geometric techniques for reconstructing 3D vessel trees from biplane image
Sorting Jordan sequences in linear time
Solution of Scott's problem on the number of directions determined by a point set in 3-space
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning
Decomposing polygonal regions into convex quadrilaterals
The lifting model for reconfiguration
New Lower Bounds for epsilon-Nets
A Complete and Practical Algorithm for Geometric Theorem Proving (Extended Abstract)
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
Slice, Simplify and Stitch: Topology-Preserving Simplification Scheme for Massive Voxel Data
Motion Planning Amidst Fat Obstacles (Extended Abstract)
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon
The direct dominance problem
Implementations of the LMT Heuristic for Minimum Weight Triangulation
Eight-Partitioning Points in 3D, and Efficiently Too
Minimal Enclosing Parallelogram with Application
A General Framework for Assembly Planning: The Motion Space Approach
Sink-insertion for mesh improvement
Cache-oblivious range reporting with optimal queries requires superlinear space
Determining the Castability of Simple Polyhedra
3D Modeling using the Delaunay Triangulation
Energy-aware stage illumination
Counting and representing intersections among triangles in three dimensions
The Opaque Square
The Path of a Triangulation
The 2-center problem in three dimensions
High-Dimensional Geometry of Sliding Window Embeddings of Periodic Videos
A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency
Construction of epsilon Nets
The euclidean bottleneck steiner path problem
Towards Expressive 3D Modeling: new challenges for geometric computing
A note on binary plane partitions
3-Manifold Triangulations with Small Treewidth
Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental
Convex Polygon Containment: Improving Quadratic to Near Linear Time
Rectilinear Geodesics in 3-Space (Extended Abstract)
On conflict-free coloring of points and simple regions in the plane
Minimum dilation stars
Incremental Topological Flipping Works for Regular Triangulations
Dimension Reduction Techniques for ℓ p (1<p<2), with Applications
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles
Locality-Sensitive Hashing of Curves
Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008
An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching
On the Parameterized Complexity of Motion Planning for Rectangular Robots
Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version)
Bounded Boxes, Hausdorff Distance, and a New Proof of an Interesting Helly-Type Theorem
Polyline Simplification has Cubic Complexity
Stability of persistence diagrams
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Offline variants of the "lion and man" problem
Shadows and Slices of Polytopes
Geometric Embeddability of Complexes Is ∃ℝ-Complete
Recognition and Complexity of Point Visibility Graphs
Joint Triangulations and Triangulation Maps
Improved range searching lower bounds
A space-optimal data-stream algorithm for coresets in the plane
Self-improving algorithms for delaunay triangulations
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, Nice, France, June 4-6, 1997
The Weighted Region Problem
Low-dimensional embedding with extra information
Tight lower bounds for halfspace range searching
On the Topological Shape of Planar Voronoi Diagrams
1-String B_2-VPG Representation of Planar Graphs
Developing a Practical Projection-Based Parallel Delaunay Algorithm
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
A New Lower Bound for Semigroup Orthogonal Range Searching
Computing a canonical polygonal schema of an orientable triangulated surface
Efficient Generation of Rectangulations via Permutation Languages
Tiling with Squares and Packing Dominos in Polynomial Time
Separating a Voronoi Diagram via Local Search
Edge Partitions of Complete Geometric Graphs
Distance problems in computational geometry with fixed orientations
The Overlay of Lower Envelopes in Three Dimensions and Its Applications
Limits of Order Types
Erdős-Szekeres-Type Problems in the Real Projective Plane
High resolution surface reconstruction from overlapping multiple-views
The Hierarchical Representation of Objects: The Delaunay Tree
Reconfiguration of Colorings in Triangulations of the Sphere
Flattening single-vertex origami: the non-expansive case
Fréchet View - A Tool for Exploring Fréchet Distance Algorithms (Multimedia Exposition)
Separating an Object from its Cast
On realistic terrains
Similar simplices in a d-dimensional point set
33rd International Symposium on Computational Geometry, SoCG 2017, Brisbane, Australia, July 4-7, 2017
Diameter of polyhedra: limits of abstraction
Finding the consensus shape for a protein family
Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements
Minimax Geometric Fitting of Two Corresponding Sets of Points
A Helly-Type Theorem for Unions of Convex Sets
Nonoverlap of the Star Unfolding
Hole detection or: "how much geometry hides in connectivity?"
On Deletion in Delaunay Triangulations
Almost Sharp Bounds on the Number of Discrete Chains in the Plane
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
Manifold reconstruction using tangential Delaunay complexes
On the 2-sum embedding conjecture
The face fixer video
Fast Approximations and Coresets for (k,𝓁)-Median Under Dynamic Time Warping
Projective clustering and its application to surface reconstruction: extended abstract
Algorithmic Interpretations of Fractal Dimension
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract)
Tentative Prune-and-Search for Computing Voronoi Vertices
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time
Computing Animations of Linkages with Rotational Symmetry (Media Exposition)
Snap Rounding: A Cautionary Tale
Disk Packings and Planar Separators
Approximation algorithms for aligning points
New constructions of SSPDs and their applications
Zarankiewicz's Problem via ε-t-Nets
Reconstructing collections of arbitrary curves
Minimal Delaunay Triangulations of Hyperbolic Surfaces
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces
Approximate Euclidean Shortest Path in 3-Space
Linkless and flat embeddings in 3-space and the unknot problem
Triangles in Space or Building (and Analyzing) Castles in the Air
Construction of 1-d Lower Envelopes and Applications
Partial Surface Matching by Using Directed Footprints
Geometric Spanners for Points Inside a Polygonal Domain
An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti Number
Different bounds on the different Betti numbers of semi-algebraic sets
Exploring Circle Packing Algorithms
Robust Sylvester-Gallai Type Theorem for Quadratic Polynomials
On a forgotten conjecture from a famous paper of Erdös
Algorithms for Length Spectra of Combinatorial Tori
A tight bound on the number of geometric permutations of convex fat objects in R d
Shortest Path to a Segment and Quickest Visibility Queries
Consistent digital rays
Reeb spaces of piecewise linear mappings
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations
Programming with CGAL: The Example of Triangulations
On the Union of k -Curved Objects
The Geodesic Edge Center of a Simple Polygon
3SUM and Related Problems in Fine-Grained Complexity (Invited Talk)
On the structure and composition of forbidden sequences, with geometric applications
A simple and efficient kinetic spanner
Parallel Robust Algorithms for Constructing Strongly Convex Hulls
Monotone paths in line arrangement
A Global Motion Planner for a Mobile Robot on a Terrain
The Complexity of the Union of (alpha, beta)-Covered Objects
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces
Multiresolution Banded Refinement to Accelerate Surface Reconstruction from Polygons
Protein molecules in 3D: complex behavior from simple local geometry plus weak interactions
Comparing distributions and shapes using the kernel distance
An Expander-Based Approach to Geometric Optimization
Parameterized complexity of discrete morse theory
Improved bounds for incidences between points and circles
An Incremental Algorithm for Betti Numbers of Simplicial Complexes
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
Topological Analysis of Scalar Fields with Outliers
Realizations of Indecomposable Persistence Modules of Arbitrarily Large Dimension
Approximating the Fréchet distance for realistic curves in near linear time
From a (p, 2)-Theorem to a Tight (p, q)-Theorem
On Geometric Optimization with Few Violated Constraints
Kinetic sorting and kinetic convex hulls
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries
New Bounds for Range Closest-Pair Problems
Effective Nearest Neighbors Searching on the Hyper-Cube, with Applications to Molecular Clustering
Approximability of the Discrete Fréchet Distance
An empirical comparison of techniques for updating Delaunay triangulations
An Optimal Parallel Algorithm for Detecting Weak Visibility of a Simple Polygon
Hinged dissections exist
Extended Gaussian images, mixed volumes, shape reconstruction
Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems
Dynamic coresets
Minimum Strictly Convex Quadrangulations of Convex Polygons
Classical Computational Geometry in GeomNet
GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes
Walking on an Arrangement Topologically
Computing Convolutions by Reciprocal Search
Space Exploration via Proximity Search
Computing the Multicover Bifiltration
On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract)
Exact Primitives for Smallest Enclosing Ellipses
A Geometric Approach to Computing Higher Order Form Factors
Animating the Polygon-Offset Distance Function
Visualizing Scissors Congruence
Avoiding the Global Sort: A Faster Contour Tree Algorithm
r -Regular Shape Reconstruction from Unorganized Points
Shortest paths on realistic polyhedra
Optimal Floodlight Illumination of Stages
Improving the surface cycle structure for hexahedral mesh generation
Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, Genetic Algorithms and ILPs (CG Challenge)
Incidence and Nearest-Neighbor Problems for Lines in 3-Space
The Maximum Clique Problem in a Disk Graph Made Easy
Range Searching with Efficient Hierarchical Cuttings
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
On Rich Points and Incidences with Restricted Sets of Lines in 3-Space
Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988
A Positive Fraction Erdős-Szekeres Theorem and Its Applications
Four-Polytopes and a Funeral (for my conjecture)
A Condition Guaranteeing the Existence of Higher-Dimensional Constrained Delaunay Triangulations
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon
Construction of Contour Trees in 3D in O(n log n) Steps
Modeling planar configurations
Feature-Based Surface Decomposition for Polyhedral Morphing
Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration
Probing a Scene of Non Convex Polyhedra
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
An Efficient Algorithm for Link-Distance Problems
Two Proofs for Shallow Packings
On the ICP algorithm
Approximating loops in a shortest homology basis from point data
Drawings of Complete Multipartite Graphs up to Triangle Flips
Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane
Covering Rectangles by Disks: The Video (Media Exposition)
A Sparse Multicover Bifiltration of Linear Size
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach
Optimality of Geometric Local Search
On the Number of Maximum Empty Boxes Amidst n Points
Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory
The Trisection Genus of Standard Simply Connected PL 4-Manifolds
Reconstructing shapes with guarantees by unions of convex sets
Intersecting quadrics: an efficient and exact implementation
Minimum-cost load-balancing partitions
Linear Data Structures for Two Types of Range Search
Approximate Range Searching
Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes
On partitioning polygons
A trace bound for the hereditary discrepancy
Proximity of persistence modules and their diagrams
Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D
Measure-Theoretic Reeb Graphs and Reeb Spaces
Sphere packings and generative
Pointed and colored binary encompassing trees
Optimal area-sensitive bounds for polytope approximation
A Perturbation Scheme for Spherical Arrangements with Application to Molecular Modeling
Stability of Delaunay-type structures for manifolds: [extended abstract]
Stability and Approximations for Decorated Reeb Spaces
Elder-Rule-Staircodes for Augmented Metric Spaces
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
Shortest Path Embeddings of Graphs on Surfaces
Visualizing bregman voronoi diagrams
On topological changes in the delaunay triangulation of moving points
Stabbing horizontal segments with vertical rays
How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
An Optimal Algorithm for the Separating Common Tangents of Two Polygons
A fast algorithm for well-spaced points and approximate delaunay graphs
Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries
Adding one edge to planar graphs makes crossing number hard
Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size
Worst-Case Bounds for Subadditive Geometric Graphs
The sticky geometry of the cosmic web
Approximating Tverberg points in linear time for any fixed dimension
Weak 1/r-Nets for Moving Points
On the Beer Index of Convexity and Its Variants
Fitting spheres to electron density
Exact Minkowski sums of convex polyhedra
Exact Geometric Predicates Using Cascaded Computation
Multi-Criteria Geometric Optimization Problems in Layered Manufacturing
Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications
Immersions and Albertson's Conjecture
Computing Simple Circuits from a Set of Line Segments is NP-Complete
Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets
Tracking the Persistence of Harmonic Chains: Barcode and Stability
Local polyhedra and geometric graphs
Area-Efficient Upward Tree Drawings
High Dimensional Consistent Digital Segments
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge)
Chunk Reduction for Multi-Parameter Persistent Homology
Building Efficient and Compact Data Structures for Simplicial Complexes
Geometric Algorithms for a Minimum Cost Assignment Problem
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Parameterized Complexity of Quantum Knot Invariants
Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay Triangulations
Non-Euclidean Erdős-Anning Theorems
On the distinct distances determined by a planar point set
Properties of the Delaunay Triangulation
The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard
Plane embeddings of planar graph metrics
On Grids in Point-Line Arrangements in the Plane
Complete, exact, and efficient computations with cubic curves
Approximation Algorithms for Multiple-Tool Miling
There is a Universal Topological Plane
A theorem of bárány revisited and extended
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Enumeration and Visibility Problems in Integer Lattices (Extended Abstract)
Complexity of the delaunay triangulation of points on surfaces the smooth case
Signotopes with Few Plus Signs
A General Heuristic Approach for Maximum Polygon Packing (CG Challenge)
Single-Source Shortest Path Problem in Weighted Disk Graphs