yusuke1997/dblp-id-title huggingface dataset:
The Point-Boundary Art Gallery Problem Is ∃ℝ-Hard
Convergence between Categorical Representations of Reeb Space and Mapper
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures
Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition)
On levels in arrangements of curves, iii: further improvements
Computing Oriented Spanners and Their Dilation
Wrapping Cycles in Delaunay Complexes: Bridging Persistent Homology and Discrete Morse Theory
Finding All Maximal Subsequences with Hereditary Properties
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams
Halfspace range search: an algorithmic application of K-sets
Planar visibility: testing and counting
Manifold reconstruction in arbitrary dimensions using witness complexes
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
The 2-center problem with obstacles
Good NEWS: partitioning a simple polygon by compass directions
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets
The pachner graph and the simplification of 3-sphere triangulations
Application of an Effective Geometric Clustering Method to the Color Quantization Problem
New Techniques for Exact and Approximate Dynamic Closest-Point Problems
Planning the shortest path for a disc in O ( n 2 log n ) time
Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004
Interactive visualization of 3D configuration spaces
Assembling Objects Through Parts Correlation
The Sum of Squares in Polycubes (Media Exposition)
Finding Shortest Reconfiguration Sequences for Modular Robots (Media Exposition)
Max-Sum Diversity Via Convex Programming
On Range Reporting, Ray Shooting and k -Level Construction
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
Shadoks Approach to Knapsack Polygonal Packing (CG Challenge)
Optimal reconstruction might be hard
Coloring Points with Respect to Squares
Immobilizing Polygons against a Wall
Shortest path amidst disc obstacles is computable
On Balls in a Hilbert Polygonal Geometry (Multimedia Contribution)
Rectilinear and Polygonal p -Piercing and p -Center Problems
An efficient, exact, and generic quadratic programming solver for geometric optimization
Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space
A Universal Slope Set for 1-Bend Planar Drawings
Complexity of Maximum Cut on Interval Graphs
The Erdős-Szekeres Conjecture Revisited
The complexity of (un)folding
Computing the Fréchet distance between simple polygons in polynomial time
Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version)
A kinetic triangulation scheme for moving points in the plane
Farthest neighbors and center points in the presence of rectangular obstacles
No dimension independent core-sets for containment under homothetics
Constructing Concise Convex Covers via Clique Covers (CG Challenge)
Nearest Neighbor Problems
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons
Piecewise Linear Approximation of Bézier-Curves
Curves in Rd intersecting every hyperplane at most d + 1 times
Optimal partition trees
Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors
Circumscribing Polygons and Polygonizations for Disjoint Line Segments
Fast software for box intersections
Long Alternating Paths Exist
Algorithmic Tolerances and Semantics in Data Exchange
Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points
Envelope surfaces
Polyhedron Realization and Its Application to Metamorphosis
Results on k -Sets and j -Facets via Continuous Motion
Fréchet Edit Distance
Optimal Geometric Flows via Dual Programs
Certified computation of planar morse-smale complexes
Shortest Rectilinear Paths among Weighted Obstacles
Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles
A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application
Geometric tomography: a limited-view approach for computed tomography
Convex Polygons in Cartesian Products
Sphere and dot product representations of graphs
Guard placement for efficient point-in-polygon proofs
Learning smooth objects by probing
Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search
Flipping Edges in Triangulations
Untangling triangulations through local explorations
On-line Coloring between Two Lines
On the Combinatorial Complexity of Approximating Polytopes
Relative Persistent Homology
Tree Drawings Revisited
Smallest Enclosing Cylinders
Robust geometric spanners
Covering Points by Hyperplanes and Related Problems
Topological Universality of the Art Gallery Problem
An optimal algorithm for the minimum edge cardinality cut surface problem
Tessellation analysis of the cosmic web
Order on Order Types
Complete subdivision algorithms, I: intersection of Bezier curves
Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons
Measuring Distance between Reeb Graphs
Computing separating planes for pairs of disjoint polytopes
Necessary Conditions for Boundary Representation Variance
Orthogonal Terrain Guarding is NP-complete
Riemannian Simplices and Triangulations
The complexity of the normal surface solution space
Constrained and Ordered Level Planarity Parameterized by the Number of Levels
Hard Diagrams of Split Links
Morphing Contact Representations of Graphs
Computating the width of a set
A Family of Metrics from the Truncated Smoothing of Reeb Graphs
A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP
Numerical Stability of Geometric Algorithms
Peeling Potatoes Near-Optimally in Near-Linear Time
Localized delaunay refinement for piecewise-smooth complexes
Deletion in Abstract Voronoi Diagrams in Expected Linear Time
Weak feature size and persistent homology: computing homology of solids in R n from noisy data samples
Extending Drawings of Graphs to Arrangements of Pseudolines
A 3-D visualization of kirkpatrick's planar point location algorithm
On Monotone Paths Among Obstacles with Applications to Planning Assemblies
Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences
Approximate convex decomposition
Minimum-Error Triangulations for Sea Surface Reconstruction
Proximate planar point location
Orientation Preserving Maps of the Square Grid
Vertex-unfoldings of simplicial manifolds
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986
Clustering Algorithms Based on Minimum and Maximum Spanning Trees
Approximate bregman near neighbors in sublinear time: beyond the triangle inequality
Planar minimally rigid graphs and pseudo-triangulations
Generalizing Ham Sandwich Cuts to Equitable Subdivisions
Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction
On Lines Missing Polyhedral Sets in 3-Space
Range searching in a set of line segments
An extension of CGAL to the oriented projective plane T 2 and its dynamic visualization system
Topology guaranteeing manifold reconstruction using distance function to noisy data
Approaching the Largest beta-Skeleton within a Minimum Weight Triangulation
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes
Testing Control Systems Through Dynamic Simulation
On the number of embeddings of minimally rigid graphs
Skewed Projections with an Application to Line Stabbing in R3
Barycentric Cuts Through a Convex Body
Incremental Planar Nearest Neighbor Queries with Optimal Query Time
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
Computing the Geometric Intersection Number of Curves
Schnyder woods for higher genus triangulated surfaces
The graphs of planar soap bubbles
Predicates for line transversals to lines and line segments in three-dimensional space
Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time
Computational Complexity of Combinatorial Surfaces
Computing the Link Center of a Simple Polygon
FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector Bundles
Empty Squares in Arbitrary Orientation Among Points
Maximum Betti Numbers of Čech Complexes
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
The Power of Coherence: Fast Tessellation of Surfaces
On planar point sets with the pentagon property
Incremental and Interactive PQ- and PC-Trees (Media Exposition)
Degenerate Convex Hulls in High Dimensions without Extra Storage
Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon
Geometry in GIS is not Combinatorial: Segment Intersection for Polygon Overlay
Arrangements of geodesic arcs on the sphere
Proceedings of the Third Annual Symposium on Computational Geometry, Waterloo, Ontario, Canada, June 8-10, 1987
Origamizer: A Practical Algorithm for Folding Any Polyhedron
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Optimally Sparse Spanners in 3-Dimensional Euclidean Space
Low-Quality Dimension Reduction and High-Dimensional Approximate Nearest Neighbor
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12
Triangulations Intersect Nicely
Coresets for polytope distance
On Minimal Rectilinear Steiner Trees in All Dimensions
Implementing time-varying contour trees
Weak Coloring Numbers of Intersection Graphs
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals
The corner arc algorithm
Densest tanslational lattice packing of non-convex polygons (extended abstract)
Compliant Motion in a Simple Polygon
Compressive sensing with local geometric features
Improved Approximation Algorithms for Three-Dimensional Knapsack
The HOMFLY-PT Polynomial is Fixed-Parameter Tractable
An Optimal Algorithm for Finding Segments Intersections
Efficient Algorithms for Geometric Partial Matching
Approximate Nearest Neighbor Queries Revisited
Finding Tailored Partitions
Analysis of a Simple Yet Efficient Convex Hull Algorithm
Point-Sets with few k -Sets
Grid Peeling of Parabolas
k-Dimensional Transversals for Fat Convex Sets
Consistent calculations for solids modeling
Morse-smale complexes for piecewise linear 3-manifolds
Visibility maps of realistic terrains have linear smoothed complexity
Counting Triangle Crossings and Halving Planes
Effectiveness of Local Search for Geometric Optimization
Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version)
Towards and open curved kernel
Geometric algorithms for static leaf sequencing problems in radiation therapy
Edge-Unfolding Nearly Flat Convex Caps
Approximating Weighted Shortest Paths on Polyhedral Surfaces
Eliminating Tverberg Points, I. An Analogue of the Whitney Trick
Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions
Applications of Incidence Bounds in Point Covering Problems
An Improved Bound for the Size of the Set A/A+A
How to Take Short Cuts
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
Covering cubes and the closest vector problem
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
Output-size sensitive algorithms for finding maximal vectors
Improved bounds for the conflict-free chromatic art gallery problem
A Wavelet Approach to Foveating Images
Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation
The Table Layout Problem
A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects
Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications
Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract)
Optimal succinct representations of planar maps
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs
40th International Symposium on Computational Geometry, SoCG 2024, Athens, Greece, June 11-14, 2024
Graph induced complex on point data
Circular partitions with applications to visualization and embeddings
Helly-type theorems for approximate covering
Line transversals to disjoint balls
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope
Minimum-Membership Geometric Set Cover, Revisited
Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs
Motion Planning in the Presence of Movable Obstacles
Geometric Inference on Kernel Density Estimates
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs
Simultaneous Nearest Neighbor Search
Abstract Voronoi-Like Graphs: Extending Delaunay's Theorem and Applications
Separator Theorem and Algorithms for Planar Hyperbolic Graphs
On Levels of Detail in Terrains
Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms
An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles
Degenerate Convex Hulls On-Line in Any Fixed Dimension
Arrangements of double pseudolines: extended abstract
Minimally Covering a Horizontally Convex Orthogonal Polygon
Quasi-Universality of Reeb Graph Distances
38th International Symposium on Computational Geometry, SoCG 2022, Berlin, Germany, June 7-10, 2022
The Persistent Homology of Distance Functions under Random Projection
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
Geometric Spanners of Bounded Tree-Width
MAPC: A Library for Efficient and Exact Manipulation of Algebraic Points and Curves
Dynamic Planar Orthogonal Point Location in Sublogarithmic Time
Quickest paths, straight skeletons, and the city Voronoi diagram
Intrinsic Topological Transforms via the Distance Kernel Embedding
Meta-Diagrams for 2-Parameter Persistence
37th International Symposium on Computational Geometry, SoCG 2021, Buffalo, NY, USA (Virtual Conference), June 7-11, 2021
On the Number of Ordinary Lines Determined by Sets in Complex Space
Stabbing Pairwise Disjoint Translates in Linear Time
The ε-t-Net Problem
Mappings and meshes
Ham Sandwich is Equivalent to Borsuk-Ulam
On Exact Solutions for the Rectilinear Steiner Tree Problem
Projective clustering in high dimensions using core-sets
Curvature-bounded traversals of narrow corridors
Improvements on Bottleneck Matching and Related Problems Using Geometry
New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract)
Practical methods for shape fitting and kinetic data structures using core sets
Visualizing 3D Euler spirals
Medial axis approximation and unstable flow complex
Embedding rivers in polyhedral terrains
Optimal Motion Planning for a Rod in the Plane Subject to Velocity Constraints
Online dispersion algorithms for swarms of robots
The one-round Voronoi game
Table Based Detection of Degenerate Predicates in Free Space Construction
A New Technique to Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection
A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains
Inequalities for the curvature of curves and surfaces
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
Packing Disks into Disks with Optimal Worst-Case Density
On regular vertices on the union of planar objects
The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation
Snap Rounding Line Segments Efficiently in Two and Three Dimensions
Approximation and Exact Algorithms for Minimum-Width Annuli and Shells
The Spiroplot App (Media Exposition)
Computing a Dirichlet Domain for a Hyperbolic Surface
Exact workspace boundary by extremal reaches
A geometric approach to collective motion
Minimum perimeter convex hull of imprecise points in convex regions
Average-Case Ray Shooting and Minimum Weight Triangulations
The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms
A center transversal theorem for hyperplanes and applications to graph drawing
Uniform Bounds on Product Sylvester-Gallai Configurations
Interlocked open linkages with few joints
Linear Size Universal Point Sets for Classes of Planar Graphs
Moving a Disc Between Polygons
Dynamic maintenance of molecular surfaces under conformational changes
Shortest Paths Among Obstacles in the Plane
Fast Algorithms for Geometric Consensuses
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels
Exact Algorithms for Minimum Dilation Triangulation
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
An Interactive Environment for Visualizing and Animating Algorithms
A Practical Algorithm for Knot Factorisation
Three-Chromatic Geometric Hypergraphs
Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings
The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk)
Smooth kinetic maintenance of clusters
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
On the Shadow Simplex Method for Curved Polyhedra
Embedding 3-polytopes on a small grid
Near Neighbor Search via Efficient Average Distortion Embeddings
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
Accelerated Occlusion Culling using Shadow Frusta
k-Median Clustering Under Discrete Fréchet and Hausdorff Distances
Two Approaches to Building Time-Windowed Geometric Data Structures
Maximum Overlap Area of a Convex Polyhedron and a Convex Polygon Under Translation
A Canonical Tree Decomposition for Chirotopes
Primitives for the Manipulation of Three-Dimensional Subdivisions
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
Coordinated Motion Planning for Two Independent Robots
Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis
Ramsey-Type Results for Geometric Graphs
Geometric Models for Musical Audio Data
Contour Trees and Small Seed Sets for Isosurface Traversal
Epsilon Geometry: Building Robust Algorithms from Imprecise Computations
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
Visualizing Sparse Filtrations
Finite metric spaces: combinatorics, geometry and algorithms
Distributed computation of virtual coordinates
New upper bounds on the quality of the PCA bounding boxes in r 2 and r 3
Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing
Enumerating order types for small sets with applications
A (Usually?) Connected Subgraph of the Minimum Weight Triangulation
Optimal Robot Localization in Trees
Algorithms for Halfplane Coverage and Related Problems
An improved algorithm for constructing kth-order Voronoi diagrams
Redelmeier's algorithm for counting lattice animals
GAWAIN: Visualizing Geometric Algorithms with Web-Based Animation
An Efficient Algorithm for One-Step Planar Complaint Motion Planning with Uncertainty
On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and Other Applications
On Computing the Fréchet Distance Between Surfaces
Disjoint edges in complete topological graphs
Minimum weight triangulation is NP-hard
Exact Collision Detection for Interactive Environments (Extended Abstract)
Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions
Topological Data Analysis in Information Space
Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition)
Area-universal rectangular layouts
Minimum Dissection of Rectilinear Polygon with Arbitrary Holes into Rectangles
Chasing Puppies: Mobile Beacon Routing on Closed Curves
Strongly Monotone Drawings of Planar Graphs
Dense Graphs Have Rigid Parts
The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles
Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related Problems
A fast and simple surface reconstruction algorithm
Smallest k-Enclosing Rectangle Revisited
Random monotone paths on polyhedra
Sliver Exudation
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More
A Stepping-Up Lemma for Topological Set Systems
Almost All String Graphs are Intersection Graphs of Plane Convex Sets
Visualization of Floater and Gotsman's Morphing Algorithm
Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
Paper position sensing
Exploiting temporal coherence in forest dynamics simulation
Linear transformation distance for bichromatic matchings
Ruler of the Plane - Games of Geometry (Multimedia Contribution)
Topologically Trivial Closed Walks in Directed Surface Graphs
Faster core-set constructions and data stream algorithms in fixed dimensions
Randomized Parallel Algorithms for Trapezoidal Diagrams
Selecting Distances in the Plane
Robust Adaptive Floating-Point Geometric Predicates
A dynamic data structure for approximate range searching
Stretchability of Star-Like Pseudo-Visibility Graphs
Polymake: an approach to modular software design in computational geometry
Growing fat graphs
Splitting a Complex of Convex Polytopes In Any Dimension
Dynamic well-spaced point sets
Rainbow Cycles in Flip Graphs
A lower bound on the distortion of embedding planar metrics into Euclidean space
Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition)
An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology
Geometric Decision Trees for Optical Character Recognition (Extended Abstract)
A Helly-type theorem for hyperplane transversals to well-separated convex sets
Streaming algorithms for line simplification
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles
The scale axis picture show
The Unbearable Hardness of Unknotting
A Computational geometry Workbench
Fining k Points with Minimum Spanning Trees and Related Problems
The power of nonmonotonicity in geometric searching
VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition)
Klee's measure problem on fat boxes in time PARTIAL DIFFERENTIAL ( n ( d +2)/3 )
Computing Instance-Optimal Kernels in Two Dimensions
On approximate range counting and depth
Ramsey-type results for semi-algebraic relations
A generic algebraic kernel for non-linear geometric applications
Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique
Hidden Surface Removal for Rectangles
Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes
The Planar Tree Packing Theorem
Preconditioning for the Geometric Transportation Problem
Computing the Irreducible Real Factors and Components of an Algebraic Curve
PTAS for geometric hitting set problems via local search
Fully dynamic geometric spanners
A Structure Theorem for Pseudo-Segments and Its Applications
The Complexity of Many Faces in Arrangements of Lines and of Segments
A Theory of Sub-Barcodes
Removing Connected Obstacles in the Plane Is FPT
Curve reconstruction from noisy samples
Long Plane Trees
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages
Demystifying Latschev's Theorem: Manifold Reconstruction from Noisy Data
Fractal Dimension and Lower Bounds for Geometric Problems
Stable Placements for Spider Robots
The geometric stability of voronoi diagrams with respect to small changes of the sites
On the computation of 3d periodic triangulations