yusuke1997/dblp-id-title huggingface dataset:
Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems
Thick non-crossing paths and minimum-cost flows in polygonal domains
String graphs and incomparability graphs
Cup Product Persistence and Its Efficient Computation
Reconstructing Sets from Interpoint Distances (Extended Abstract)
Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions
Two Algorithms for Polyhedral Pictures
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
Reconstruction curves with sharp corners
Maximizing the overlap of two planar convex sets under rigid motions
Degree Four Plane Spanners: Simpler and Better
Incremental Collision Detection for Polygonal Models
On locally Delaunay geometric graphs
Balanced lines, halving triangles, and the generalized lower bound theorem
Structure and Generation of Crossing-Critical Graphs
Structure and Independence in Hyperbolic Uniform Disk Graphs
Computing a convex skill of an orthogonal polygon
Provable surface reconstruction from noisy samples
Dynamic Maximum Depth of Geometric Objects
On the Number of Rich Lines in Truly High Dimensional Sets
On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time
The Parameterized Complexity of Guarding Almost Convex Polygons
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension
Approximating the (Continuous) Fréchet Distance
Searching for the Closest-Pair in a Query Translate
Embeddability in the 3-sphere is decidable
The Visibility-Voronoi Complex and Its Applications
Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead
Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line
Homotopy techniques for real-time visualization of geometric tangent problems
Discrete mobile centers
Near-linear approximation algorithms for geometric hitting sets
Restricted delaunay triangulations and normal cycle
Object-image correspondence for curves under central and parallel projections
Small-size relative ( p , ε)-approximations for well-behaved range spaces
Computing the exact arrangement of circles on a sphere, with applications in structural biology: video
Polytopes in Arrangements
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Determining Sector Visibility of a Polygon
Computing approximate shortest paths on convex polytopes
Origin-embracing distributions or a continuous analogue of the upper bound theorem
Fast penetration depth estimation using rasterization hardware and hierarchical refinement
On the Maximum Degree of Minimum Spanning Trees
Tighter bounds for random projections of manifolds
The Rotation Diagram and Optimal Containing Placements of a Convex Polygon
Building and Using Polyhedral Hierarchies
Geometric Algorithms for Sampling the Flux Space of Metabolic Networks
Dynamization of geometric data structures
On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects
Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors
SCARST: Schnyder Compact and Regularity Sensitive Triangulation Data Structure
Matching 2D Patterns of Protein Spots
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem
Ipelets for the Convex Polygonal Geometry (Media Exposition)
Consistent digital line segments
The Video "Geodesics and Waves"
Resource-Constrained Geometric Network Optimization
Computation of Toroidal Schnyder Woods Made Simple and Fast: From Theory to Practice
Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties
Recent progress on the combinatorial diameter of polyhedra and simplicial complexes
On empty convex polygons in a planar point set
Convex hull of imprecise points in o(n log n) time after preprocessing
The Hardness of Approximation of Euclidean k-Means
Finding Large Counterexamples by Selectively Exploring the Pachner Graph
Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space
Provable dimension detection using principal component analysis
On Optimal 2- and 3-Planar Graphs
Faster Algorithms for some Optimization Problems on Collinear Points
The predicates for the Voronoi diagram of ellipses
Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler Divergence
Towards persistence-based reconstruction in euclidean spaces
On the union of kapa-round objects
GPU Algorithm for Enumerating PL Spheres of Picard Number 4: Application to Toric Topology
Integral estimation from point cloud in d-dimensional space: a geometric view
I/o-efficient efficient algorithms for computing contours on a terrain
Efficient perspective-accurate silhouette computation and applications
An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)
On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets
Stochastic Convergence of Persistence Landscapes and Silhouettes
Complexity analysis of random geometric structures made simpler
The smallest enclosing ball of balls: combinatorial structure and algorithms
Acute Tours in the Plane
Acute triangulations of polyhedra and the Euclidean space
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time
The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields
Point Location in Dynamic Planar Subdivisions
Constructive root bound for k -ary rational input numbers
Determining Contractibility of Curves
GPU Computation of the Euler Characteristic Curve for Imaging Data
Overlaying Simply Connected Planar Subdivisions in Linear Time
Testing Homotopy for paths in the plane
Faster Output-Sensitive Parallel Convex Hulls for d <=3: Optimal Sublogarithmic Algorithms for Small Outputs
Kinetic stable Delaunay graphs
Visualizing and Unfolding Nets of 4-Polytopes (Media Exposition)
A Polynomial Time Algorithm for Minkowski Reconstruction
Guaranteed-Quality Delaunay Meshing in 3D (Short Version)
Embedding ultrametrics into low-dimensional spaces
Objects That Cannot be Taken Apart with Two Hands
Sparse Higher Order Čech Filtrations
Shellability is NP-Complete
Upward Book Embeddings of st-Graphs
Shortest Path in a Polygon using Sublinear Space
Alexander duality for functions: the persistent behavior of land and water and shore
Persistence-based clustering in riemannian manifolds
Kink-Free Deformations of Polygons
3D Visibility Made Visibly Simple: An Introduction to the Visibility Skeleton
The Clarkson-Shor technique revisited and extended
An improved bound for k -sets in three dimensions
Automatic Proofs for Formulae Enumerating Proper Polycubes
Pitfalls in computing with pseudorandom determinants
Colouring Polygon Visibility Graphs and Their Generalizations
French Onion Soup, Ipelets for Points and Polygons (Media Exposition)
Diverse near neighbor problem
The convex hull of ellipsoids
Voronoi-based interpolation with higher continuity
Tracking Dynamical Features via Continuation and Persistence
An optimal generalization of the centerpoint theorem, and its extensions
A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane
Point sets with many k -sets
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
Smooth Paths in a Polygonal Channel
The connectivity shapes video
Minimum-Link Paths Among Obstacles in the Plane
The Localized Union-Of-Balls Bifiltration
A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time
Voronoi Diagrams and Containment of Families of Convex Sets on the Plane
Exact minkowski sums and applications
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices
Probabilistic Analysis for Combinatorial Functions of Moving Points
A Note on the No-(d+2)-On-a-Sphere Problem
A pedagogic JavaScript program for point location strategies
Near Isometric Terminal Embeddings for Doubling Metrics
Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version)
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
Topological inference via meshing
Computing Zigzag Persistence on Graphs in Near-Linear Time
Extremal Betti Numbers and Persistence in Flag Complexes
Adventures of Möbius band: mathematical visualization in virtual environment
Merging Visibility Maps
Dynamic Point Location in Arrangements of Hyperplanes
Slimming Down by Adding: Selecting Heavily Covered Points
Crossing Families
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs
An NC Parallel 3D Convex Hull Algorithm
Incidences in three dimensions and distinct distances in the plane
A sampling theory for compact sets in Euclidean space
Straight skeletons of three-dimensional polyhedra
Computing Shapley Values in the Plane
When Convexity Helps Collapsing Complexes
Points and Triangles in the Plane and Halving Planes in Space
Near-Optimal Coresets of Kernel Density Estimates
Apex Representatives
Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees
The Multi-cover Persistence of Euclidean Balls
Visualizing and exploring planar algebraic arrangements: a web application
Computing the Fréchet Gap Distance
A fast k-means implementation using coresets
Epsilon-Nets and Simplex Range Queries
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators
Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994
Fine-Grained Complexity of Earth Mover's Distance Under Translation
On the General Motion Planning Problem with Two Degrees of Freedom
The Connect-The-Dots Family of Puzzles: The Video
Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises
Designing a Data Structure for polyhedral Surfaces
Distinct distances in homogeneous sets
Star Unfolding from a Geodesic Curve
Saturation Results Around the Erdős-Szekeres Problem
Steinhaus Filtration and Stable Paths in the Mapper
Some Provably Hard Crossing Number Problems
How to Find a Point in the Convex Hull Privately
A PTAS for TSP with Neighbourhoods over Parallel Line Segments
Simple Traversal of a Subdivision Without Extra Storage
O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem
Reeb graphs: approximation and persistence
Geometry-based reasoning for a large sensor network
Computing Partial Sums in Multidimensional Arrays
Accounting for Boundary Effects in Nearest Neighbor Searching
Persistent Homology Based Characterization of the Breast Cancer Immune Microenvironment: A Feasibility Study
Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates
Geometric tomography with topological guarantees
Kinetic mesh refinement in 2D
An Implementation for Maintaining Arrangements of Polygons
Decomposition of multiple coverings into many parts
Splitting (complicated) surfaces is hard
Inner and outer rounding of set operations on lattice polygonal regions
Throwing a Sofa Through the Window
Quadrilateral meshes with bounded minimum angle
Delaunay triangulations with disconnected realization spaces
Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry
Local Equivalence and Intrinsic Metrics between Reeb Graphs
On the Treewidth of Triangulated 3-Manifolds
Self-Approaching Paths in Simple Polygons
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n) 2 ) Time
Arrangements of Segments that Share Endpoints: Single Face Results
The Visibility Complex
Parameterized Algorithms for Upward Planarity
On the Number of Faces in Higher-Dimensional Voronoi Diagrams
Tight Lower Bounds for Approximate & Exact k-Center in ℝ d
Computing the largest empty convex subset of a set of points
A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams
Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions
On the topology of planar algebraic curves
Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013
Variations on Visibility
Computing Envelopes in Four Dimensions with Applications
Homotopic Curve Shortening and the Affine Curve-Shortening Flow
Cache-oblivious planar orthogonal range searching and counting
Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems
An Algorithm to Compute the Minkowski Sum Outer-face of Two Simple Polygons
A Subexponential Bound for Linear Programming
Stabbing Convex Bodies with Lines and Flats
An Efficient Algorithm to Determine the Image of a Parallelepiped Under a Linear Transformation
Minimum Manhattan network is NP-complete
Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989
Sylvester-Gallai for Arrangements of Subspaces
Evaluation of a New Method to Compute Signs of Determinants
Computing Roundness is Easy if the Set is Almost Round
Hybrid meshes: multiresolution using regular and irregular refinement
Ephemeral Persistence Features and the Stability of Filtered Chain Complexes
Motion Planning for Multiple Robots
Convex Surface Decomposition
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems
Representation and Computation of Boolean Combinations of Sculptured Models
Stochastic minimum spanning trees in euclidean spaces
Kinetic spanners in R d
Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition)
Reachability by paths of bounded curvature in convex polygons
An Acyclicity Theorem for Cell Complexes in d Dimensions
Controlled perturbation for arrangements of circles
Box-trees for collision checking in industrial installations
Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems
Range-Clustering Queries
Hop-Spanners for Geometric Intersection Graphs
Triangulations in CGAL (extended abstract)
A Class of Convex Programs with Applications to Computational Geometry
Minimum Scan Cover with Angular Transition Costs
Design of 3D printed mathematical art
On Ray Shooting for Triangles in 3-Space and Related Problems
Efficient Random-Walk Methods for Approximating Polytope Volume
Improved upper bounds on the crossing number
Improved Incremental Randomized Delaunay Triangulation
Classifying Convex Bodies by Their Contact and Intersection Graphs
Zigzag persistent homology and real-valued functions
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations
Computing Betti Tables and Minimal Presentations of Zero-Dimensional Persistent Homology
Exact Algorithms for Circles on the Sphere
Graph Partitioning and Ordering for Interactive Proximity Queries
On Implementing Straight Skeletons: Challenges and Experiences
On the Width of Complicated JSJ Decompositions
Diameter, Width, Closest Line Pair, and Parametric Searching
How slow is the k -means method?
Kinetic Data Structures: Animating Proofs Through Time
Morphing Simple Polygons
On Computing Voronoi Diagrams by Divide-Prune-and-Conquer
Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid (CG Challenge)
Parallel geometric algorithms for multi-core computers
Linear programming queries revisited
An O(n 2 log n) Time Algorithm for the MinMax Angle Triangulation
Convex Distance Functions in 3-Space are Different
On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
Robust Anisotropic Power-Functions-Based Filtrations for Clustering
Step-By-Step Straight Skeletons (Media Exposition)
Finding the optimal shadows of a convex polytope
Visibility with Reflection
Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract)
Near-Optimal epsilon-Kernel Construction and Related Problems
On Klee's measure problem for grounded boxes
Minimum-cost coverage of point sets by disks
Characterizing bar line-of-sight graphs
Conforming Delaunay triangulations in 3D
Persistent Cup-Length
The union of congruent cubes in three dimensions
A Generalization of the Persistent Laplacian to Simplicial Maps
The Fréchet Distance Unleashed: Approximating a Dog with a Frog
On the Complexity of the k-Level in Arrangements of Pseudoplanes
How Good are Convex Hull Algorithms?
Morphing planar graphs
Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams
Computing similarity between piecewise-linear functions
Finding shortest non-trivial cycles in directed graphs on surfaces
A Spanner for the Day After
GASP: A System to Facilitate Animating Geometric Algorithms
Compliant Motion Planning with Geometric Models
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
Asymmetric Rendezvous on the Plane
Computing the Rectangle Discrepancy
Communication Complexity and Discrepancy of Halfplanes
New Methods for Computing Visibility Graphs
A New Technique for Analyzing Substructures in Arrangements
On laplacians of random complexes
Algebraic Methods for Non-Linear Computational Geometry (Invited Address)
Hadwiger and Helly-type theorems for disjoint unit spheres in R 3
How to get close to the median shape
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Robust construction of the three-dimensional flow complex
The Reeb Graph Edit Distance Is Universal
On the Number of Halving Planes
There are Plane Spanners of Maximum Degree 4
Four-Dimensional Dominance Range Reporting in Linear Space
Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings
The Complexity of the Hausdorff Distance
The complexity of separating points in the plane
Drawing Planar Partitions I: LL-Drawings and LH-Drawings
Coresets for Clustering in Geometric Intersection Graphs
Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
Radon Numbers Grow Linearly
Measuring the Resemblance of Polygonal Curves
Higher Dimensional Cheeger Inequalities
A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract)
Maintenance of the Set of Segments Visible from a Moving Viewpoint in Two Dimensions
Molecular shape analysis based upon the morse-smale complex and the connolly function
Notes on computing peaks in k-levels and parametric spanning trees
Geomview: A System for Geometric Visualization
A static optimality transformation with applications to planar point location
On Fence Design and the Complexity of Push Plans for Orienting Parts
Comparing Graphs via Persistence Distortion
On Laplacians (Invited Talk)
Fixed-Dimensional Linear Programming Queries Made Easy
Adjacency Graphs of Polyhedral Surfaces
An Improved Bound on Sums of Square Roots via the Subspace Theorem
41st International Symposium on Computational Geometry, SoCG 2025, Kanazawa, Japan, June 23-27, 2025
Grouping Time-Varying Data for Interactive Exploration
An improved algorithm for computing the volume of the union of cubes
A Product Inequality for Extreme Distances
Random Sampling with Removal
A Near-Linear Algorithm for the Planar 2-Center Problem
Triangulating Topological Spaces
Hyperplane Separability and Convexity of Probabilistic Point Sets
On the Application of Shared Retrieval to Orthogonal Range Queries
Incremental Algorithm and Local Search for Minimum Non-Obtuse Triangulations (CG Challenge)
The Complexity of Planar Compliant Motion Planning Under Uncertainty
Smaller coresets for k-median and k-means clustering
A constant-factor approximation for multi-covering with disks
d 1 -Optimal Motion for a Rod (Extended Abstract)
A traveller's problem
High-dimensional shape fitting in linear time
Exploiting topological and geometric properties for selective subdivision
Improved output-sensitive snap rounding
The Geometry and Topology of Crystals: From Sphere-Packing to Tiling, Nets, and Knots (Invited Talk)
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs
An O(n log n)-Time Algorithm for the k-Center Problem in Trees
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002
Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry
Linear-Size Nonobtuse Triangulation of Polygons
On Planning Assemblies
Geometric Graphs with Few Disjoint Edges
A near-linear constant-factor approximation for euclidean bipartite matching?
Near Optimal Locality Sensitive Orderings in Euclidean Space
Randomly removing g handles at once
Piercing Convex Sets
On the Complexity of Closest Pair via Polar-Pair of Point-Sets
Degenerate crossing numbers
Guarding a terrain by two watchtowers
Exact computation of protein structure similarity
Realization Spaces of Arrangements of Convex Bodies
Moving a Polygon Around the Corner in a Corridor
Deconstructing approximate offsets
Smallest enclosing ball for probabilistic data
Small Triangulations of 4-Manifolds and the 4-Manifold Census
Computing Zigzag Vineyard Efficiently Including Expansions and Contractions
The Upper Envelope of Voronoi Surfaces and Its Applications
Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996
On the Limited Power of Linear Probes and Other Optimization Oracles
Triangulating Simplicial Point Sets in Space
Implementing Watson's Algorithm in Three Dimensions
SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)
Long monotone paths in line arrangements
Incidences between points and circles in three and higher dimensions
Tighter Bounds for Reconstruction from ε-Samples
Holes and Islands in Random Point Sets
The geometric thickness of low degree graphs
Improved construction of vertical decompositions of three-dimensional arrangements
Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension
The Christoffel-Darboux Kernel for Topological Data Analysis
Conflict-free colorings of shallow discs
Further Results on Colored Range Searching
Markov convexity and local rigidity of distorted metrics
On the exact maximum complexity of Minkowski sums of convex polyhedra
Geometric Bipartite Matching Based Exact Algorithms for Server Problems
Point set labeling with specified positions
Irrational Guards are Sometimes Needed
Counting Circular Arc Intersections
Faster Fréchet Distance Approximation Through Truncated Smoothing
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems
Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework
A Computational Algorithm for Origami Design
Cost prediction for ray shooting
Robust Radical Sylvester-Gallai Theorem for Quadratics
Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects
New Sparseness Results on Graph Spanners
Incidences between Points and Lines in Three Dimensions
Polygon Properties Calculated from the Vertex Neighborhoods
39th International Symposium on Computational Geometry, SoCG 2023, Dallas, Texas, USA, June 12-15, 2023
Computing Persistent Homology of Flag Complexes via Strong Collapses
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
Structure and Stability of the 1-Dimensional Mapper
Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version)
A segment-tree based kinetic BSP
Continuous path verification in multi-axis NC-machining
Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time
Constrained Delaunay Triangulations
Approximating Center Points with Iterated Radon Points
k-means requires exponentially many iterations even in the plane
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
A Sparse Delaunay Filtration
The Morse Theory of Čech and Delaunay Filtrations