yusuke1997/dblp-id-title huggingface dataset:
A Geometric Consistency Theorem for a Symbolic Perturbation Scheme
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres
Parametric search made practical
Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings
Small representation of line arrangements
The Reverse Kakeya Problem
Finding Non-Orientable Surfaces in 3-Manifolds
Randomized External-Memory Algorithms for Some Geometric Problems
Pyramid computer algorithms for determining geometric properties of images
On Comparable Box Dimension
Voronoi diagrams and arrangements
Towards an implementation of the 3D visibility skeleton
Fast construction of nets in low dimensional metrics, and their applications
On the Parallel Decomposability of Geometric Problems
A Path Router for Graph Drawing
A Superlinear Lower Bound on the Number of 5-Holes
GASP-II: A Geometric Algorithm Animation System for an Electronic Classroom
An Efficient Approach to Removing Geometric Degeneracies
Sweeping Lines and Line Segments with a Heap
Proper Coloring of Geometric Hypergraphs
Geometric methods for multi-agent collision avoidance
Geometric Pattern Matching: A Performance Study
Schematization of road networks
A 2D kinetic triangulation with near-quadratic topological changes
External memory planar point location with logarithmic updates
Cutting Cylces of Rods in Space
Disjointness Graphs of Segments
Querying approximate shortest paths in anisotropic regions
Loops in reeb graphs of 2-manifolds
The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces
Distribution-Sensitive Bounds on Relative Approximations of Geometric Ranges
Simultaneous Containment of Several Polygons
Rectangular cartograms: construction & animation
Polyhedral Voronoi diagrams of polyhedra in three dimensions
The Bisector Surface of Freeform Rational Space Curves
Space crossing numbers
Inclusion-exclusion formulas from independent complexes
Computing Shortest Transversals of Sets (Extended Abstract)
Bichromatic compatible matchings
Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version)
A proof of the molecular conjecture
On overlays and minimization diagrams
Faster Algorithms for Computing Plurality Points
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
Zigzag zoology: rips zigzags for homology inference
On Rich Lenses in Planar Arrangements of Circles and Related Problems
K-d Trees for Semidynamic Point Sets
Testing graph isotopies on surfaces
Can Visibility Graphs be Represented Compactly?
Path Planning in 0/1/infinity Weighted Regions with Applications
Polynomial-Size Nonobtuse Triangulation of Polygons
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds
A Crossing Lemma for Multigraphs
Kinetic collision detection for simple polygons
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
Approximate Range Counting Under Differential Privacy
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
An upper bound on the average size of silhouettes
Hexahedral Mesh Generation via the Dual
Geometric Algorithms for Trap Design
Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs
On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result
The frechet distance revisited and extended
Optimally cutting a surface into a disk
Exact Geometric Computation in LEDA
Incidences between points and lines in R4: Extended Abstract
Euclidean bounded-degree spanning tree ratios
Witnessed k-distance
Linear Programming and Convex Hulls Made Easy
On distinct distances from a vertex of a convex polygon
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
A Geometric Data Structure from Neuroscience (Invited Talk)
Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract)
Optimal Parallel Algorithms for Polygon and Point-Set Problems
Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011
Computing Bottleneck Distance for 2-D Interval Decomposable Modules
Discrete Geometry, Algebra, and Combinatorics (Invited Talk)
Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition)
A time-optimal delaunay refinement algorithm in two dimensions
Multivariate regression depth
Reconstruction of solids
Realistic Input Models for Geometric Algorithms
On Computing Edges That Are In All Minimum-Weight Triangulations
On Shortest Paths Amidst Convex Polyhedra
Covering points with a polygon
Optimal In-Place Compaction of Sliding Cubes (Media Exposition)
Minimum Perimeter-Sum Partitions in the Plane
Embedding Graphs into Two-Dimensional Simplicial Complexes
Visualizing WSPDs and Their Applications (Media Exposition)
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005
Sharp bounds on Davenport-Schinzel sequences of every order
Divide-and-conquer for Voronoi diagrams revisited
The Discrete 2-Center Problem
Animating Geometric Algorithms Over the Web
Hardness and Approximation of Minimum Convex Partition
Random Projections for Curves in High Dimensions
An algorithm for searching a polygonal region with a flashlight
Area Optimization of Simple Polygons
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set
Area Requirement and Symmetry Display in Drawing Graphs
On Arrangements of Jordan Arcs with Three Intersections per Pair
When Alpha-Complexes Collapse onto Codimension-1 Submanifolds
Euclidean Steiner Shallow-Light Trees
Congruence, Similarity, and Symmetries of Geometric Objects
The JS-graphs of Join and Split Trees
Minkowski Operations for Satellite Antenna Layout
Vietoris-Rips and Cech Complexes of Metric Gluings
On the complexity of halfspace area queries
Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem
An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract)
Constructing Cuttings in Theory and Practice
On the reconstruction of convex sets from random normal measurements
Linear-size approximations to the vietoris-rips filtration
Interactive Geometric Algorithm Visualization in a Browser
Discrete Simulation of NC Machining
Parallel Computation of Alpha Complexes for Biomolecules
Helly Theorems and Generalized Linear Programming
Map Labeling Heuristics: Provably Good and Practically Useful
Optimal Parallel Algorithms for Triangulated Simple Polygons
Convergence of Gibbs Sampling: Coordinate Hit-And-Run Mixes Fast
Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k -Clustering (Extended Abstract)
Intersection Queries for Curved Objects (Extended Abstract)
Efficient Ray Shooting and Hidden Surface Removal
Finding the maximal empty disk containing a query point
Optimal Dynamic Solutions for Fixed Windowing Problems
New Approximation Algorithms for Touring Regions
Steinitz theorems for orthogonal polyhedra
Dynamic Geometric Set Cover and Hitting Set
Intersection of paraboloids and application to Minkowski-type problems
Intersecting convex sets by rays
Subquadratic Encodings for Point Configurations
Computing the Volume, Counting Integral Points, and Exponential Sums
Computing Non-Obtuse Triangulations with Few Steiner Points (CG Challenge)
Approximation algorithms for maximum independent set of pseudo-disks
Computing the Geodesic Diameter of a 3-Polytope
The Rectangle Enclosure and Point-Dominance Problems Revisited
Improved upper bound on the stretch factor of delaunay triangulations
A Core Library for Robust Numeric and Geometric Computation
The Number of Unit-Area Triangles in the Plane: Theme and Variations
Linear-time triangulation of a simple polygon made easier via randomization
On Rectangle-Decomposable 2-Parameter Persistence Modules
A Fire Fighter's Problem
A Cautionary Tale: Burning the Medial Axis Is Unstable (Media Exposition)
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
A Polynomial Time Solution for Labeling a Rectilinear Map
Minimum Cycle and Homology Bases of Surface Embedded Graphs
Reconfiguration of Plane Trees in Convex Geometric Graphs
Inserting Multiple Edges into a Planar Graph
Optimality of the Delaunay Triangulation in R d
Animation of Geometric Algorithms Using GeoLab
Delaunay-Like Triangulation of Smooth Orientable Submanifolds by ℓ 1 -Norm Minimization
Aperture-angle and Hausdorff-approximation of convex figures
Lower bounds on geometric Ramsey functions
Finding a Shortest Curve That Separates Few Objects from Many
Convexity Helps Iterated Search in 3D
2-point site Voronoi diagrams
Colored intersection searching via sparse rectangular matrix multiplication
On the exact computation of the topology of real algebraic curves
Lines avoiding balls in three dimensions revisited
Measuring similarity between curves on 2-manifolds via homotopy area
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
A (slightly) faster algorithm for klee's measure problem
Hausdorff distance under translation for points and balls
Combinatorial Redundancy Detection
Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function
Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract)
35th International Symposium on Computational Geometry, SoCG 2019, Portland, Oregon, USA, June 18-21, 2019
The Design of LINETOOL, a Geometric Editor
Rotational Polygon Containment and Minimum Enclosure
Reachability in a Planar Subdivision with Direction Constraints
Restricted Isometry Property for General p-Norms
A Framework for Computing the Greedy Spanner
On Levels in Arrangements of Lines, Segments, Planes, and Triangles
Dimensionality Reduction for k-Distance Applied to Persistent Homology
Some PL Functions on Surfaces are not Height Functions
Certifying and constructing minimally rigid graphs in the plane
30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan, June 08 - 11, 2014
Time-Series Similarity Problems and Well-Separated Geometric Sets
An Output Sensitive Algorithm for Discrete Convex Hulls
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound
Kinetic Connectivity of Rectangles
Semi-algebraic Ramsey Numbers
Provably good sampling and meshing of Lipschitz surfaces
Query-Sensitive Ray Shooting
An output-sensitive algorithm for persistent homology
Geometry of Planar Graphs with Angles
Empirical Testing of Algorithms for Variable-Sized Label Placement
Applications of Random Sampling in Computational Geometry, II
Finding minimal convex nested polygons
Quadratic Bounds for Hidden Line Elimination
Optimizing active ranges for consistent dynamic map labeling
A Quest to Unravel the Metric Structure Behind Perturbed Networks
The Density of Expected Persistence Diagrams and its Kernel Based Estimation
The Dirac-Motzkin Problem on Ordinary Lines and the Orchard Problem (Invited Talk)
Geometric kth Shortest Paths: the Applet
Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract)
Coloring Intersection Hypergraphs of Pseudo-Disks
On the crossing number of complete graphs
When Ternary Triangulated Disc Packings Are Densest: Examples, Counter-Examples and Techniques
On the Geometric Thickness of 2-Degenerate Graphs
More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
Fly Cheaply: On the Minimum Fuel-Consumption Problem
An Extension Theorem for Signotopes
New existence proofs epsilon-nets
Topological graphs with no self-intersecting cycle of lenth 4
Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions
Walking in a triangulation
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons
Faster Approximation Scheme for Euclidean k-TSP
Metric Embedding, Hyperbolic Space, and Social Networks
Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams
Segment intersection searching problems in general settings
Improved Bounds for Covering Paths and Trees in the Plane
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions
Computing the Fréchet distance with shortcuts is NP-hard
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
On the Complexity of Minimum-Link Path Problems
When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings
Voronoi Diagrams in the Hilbert Metric
Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks
From Geometry to Topology: Inverse Theorems for Distributed Persistence
Locked and unlocked chains of planar shapes
Point-line incidences in space
Cubic Planar Graphs That Cannot Be Drawn On Few Lines
Fine-Grained Complexity of Coloring Unit Disks and Balls
Kinetic 2-centers in the black-box model
An Interactive Framework for Reconfiguration in the Sliding Square Model (Media Exposition)
Parameterised Partially-Predrawn Crossing Number
On the Discrete Fréchet Distance in a Graph
Higher Order Bipartiteness vs Bi-Partitioning in Simplicial Complexes
Efficient Algorithms to Decide Tightness
On the set multi-cover problem in geometric settings
Deformable spanners and applications
Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range
A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
Voronoi Diagrams by Divergences with Additive Weights
Higher-Quality Tetrahedral Mesh Generation for Domains with Small Angles by Constrained Delaunay Refinement
Pseudo-Triangulations: Theory and Applications
Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes
Geometric computation with smart pixels
Near-optimal parameterization of the intersection of quadrics
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences
A new upper bound for the VC-dimension of visibility regions
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007
Sunflowers in Set Systems of Bounded Dimension
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
An Optimal Algorithm for the Two-Guard Problem
Guaranteed-Quality Mesh Generation for Curved Surfaces
Restricted Constrained Delaunay Triangulations
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001
Cutting Hyperplane Arrangements
Cache-oblivious data structures for orthogonal range searching
Space efficient dynamic orthogonal range reporting
Extremal problems on triangle areas in two and three dimensions
Designing Art Galleries (Media Exposition)
Hardware-assisted view-dependent map simplification
The Combinatorial Complexity of Hyperplane Transversals
Implicitly Representing Arrangements of Lines or Segments
Swap, Shift and Trim to Edge Collapse a Filtration
Computing the visibility graph of points within a polygon
On the Complexity of Randomly Weighted Voronoi Diagrams
Fast and Robust Computation of Molecular Surfaces
Shape fitting with outliers
Pseudotriangulations, polytopes, and how to expand linkages
Computing Topological Persistence for Simplicial Maps
Bounds for partitioning rectilinear polygons
The probabilistic complexity of the Voronoi diagram of points on a polyhedron
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
Separating point sets in polygonal environments
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams
Features of Deformation Grids: An Approach via Singularity Theory
On Visibility Representations of Non-Planar Graphs
Spacetime meshing with adaptive refinement and coarsening
Checking Geometric Programs or Verification of Geometric Structures
Almost Optimal Polyhedral Separators
Polygon Triangulation in O(n log log n) Time with Simple Data-Structures
The number of lines tangent to arbitrary convex polyhedra in 3D
Efficient Algorithms for Complexes of Persistence Modules with Applications
On the Optimal Bisection of a Polygon (Extended Abstract)
Surface Reconstruction by Voronoi Filtering
Better embeddings for planar Earth-Mover Distance over sparse sets
Homological reconstruction and simplification in R 3
Union of random minkowski sums and network vulnerability analysis
Snap rounding of Bézier curves
On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets Under Euclidean Motion in the Plane
Tracing Isomanifolds in ℝ^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations
Forbidden patterns and unit distances
Dynamic Visibility in Polygonal Scenes with the Visibility Complex
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition)
On approximating the smallest enclosing Bregman Balls
Finding planar regions in a terrain: in practice and with a guarantree
A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
On Semialgebraic Range Reporting
ε-Isometric Dimension Reduction for Incompressible Subsets of ℓ p
Experimental Results of Randomized Clustering Algorithm
Anchored Rectangle and Square Packings
Plane-Filling Trails (Media Exposition)
Space Complexity of Euclidean Clustering
Design and Analysis of Planar Shape Deformation
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 7-10, 1998
Optimal Volume-Sensitive Bounds for Polytope Approximation
Beyond Chromatic Threshold via (p, q)-Theorem, and Blow-Up Phenomenon
Fast and reliable collision detection using graphics processors
On Weak epsilon-Nets and the Radon Number
Modeling Real-World Data Sets (Invited Talk)
Geometry in the space of persistence modules
Computing Teichmüller Maps between Polygons
Finding curvature-constrained paths that avoid polygonal obstacles
Computing integer points in Minkowski sums
Bounded VC-Dimension Implies the Schur-Erdős Conjecture
A Data Front-End for Layered Manufacturing
Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition)
Decision Trees for Geometric Models
Approximate Geometric MST Range Queries
Ranger: A Tool for Nearest Neighbor Search in High Dimensions
Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions
Efficient maintenance and self-collision testing for Kinematic Chains
Engineering a compact parallel delaunay algorithm in 3D
Constructing Reeb graphs using cylinder maps
Topological Analysis of Nerves, Reeb Spaces, Mappers, and Multiscale Mappers
Extremal Polygon Containment Problems
Dynamic Smooth Compressed Quadtrees
Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics
Shortest non-trivial cycles in directed surface graphs
The Visibility Complex Made Visibly Simple: An Introduction to 2D Structures of Visibility
Dual Circumference and Collinear Sets
Collision Detection for Fly-Throughs in Virtual Environments
Banana Trees for the Persistence in Time Series Experimentally
An approximate arrangement algorithm for semi-algebraic curves
Strong Hanani-Tutte for the Torus
Optimized color gamuts for tiled displays
Vines and vineyards by updating persistence in linear time
Pseudo approximation algorithms, with applications to optimal motion planning
An Optimal Algorithm for the On-Line Closest-Pair Problem
Hyperbolic delaunay complexes and voronoi diagrams made practical
The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry
Random triangulations of planar point sets
Crossing Number is Hard for Kernelization
A Sweepline Algorithm for Voronoi Diagrams
Shortest Paths on a Polyhedron
The Euclidean degree-4 minimum spanning tree problem is NP-hard
A Packing Problem with Applications to Lettering of Maps
Probabilistic Analysis of Multiparameter Persistence Decompositions into Intervals
Curve Based Stereo Matching Using the Minimum Hausdorff Distance
Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract)
On Solving Geometric Optimization Problems Using Shortest Paths
On the euclidean bottleneck full Steiner tree problem
Accurate and efficient unions of balls
Optimal simplification of polygonal chain for rendering
Barcodes of Towers and a Streaming Algorithm for Persistent Homology
Visualization of Color Image Quantization Using Pairwise Clustering
An Approximation Algorithm for the Art Gallery Problem
Efficient Perspective-Accurate Silhouette Computation
On the number of congruent simplices in a point
Locally uniform anisotropic meshing
A parallel algorithm for computing the flow complex
Optimal Morphs of Planar Orthogonal Drawings
Applications of the Crossing Number
Persistent (Co)Homology in Matrix Multiplication Time
Triangulating unknown environments using robot swarms
The Delaunay tetrahedralization from Delaunay triangulated surfaces Sunghee Choi
Extremal reaches in polynomial time
Visibility-Based Pursuit-Evasion in a Polygonal Room with a Door
Light, Reliable Spanners
Integer representations of convex polygon intersection graphs
Discrete geometric structures for architecture
Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge)
Coordinated Motion Planning Through Randomized k-Opt (CG Challenge)
Some Geometric and Computational Challenges Arising in Structural Molecular Biology (Invited Talk)
Illustrating the streaming construction of 2D delaunay triangulations
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching
Edgewise Subdivision of a Simplex
The Crust Algorithm for 3D Surface Reconstruction
New and Improved Spanning Ratios for Yao Graphs
Computing Shortest Closed Curves on Non-Orientable Surfaces
A kuratowski-type theorem for planarity of partially embedded graphs
Testing contractibility in planar rips complexes
Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic
Monte Carlo Approximation of Form Factors with Error Bounded a Priori
Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals
Moderate Dimension Reduction for k-Center Clustering
The Crossing Tverberg Theorem
Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations
Efficient Plane Sweeping in Parallel
Points with large quadrant-depth
Cubic plane graphs on a given point set
Improved Algebraic Degeneracy Testing
Empirical Design of Geometric Algorithms
Constructing Approximate Shortest Path Maps in Three Dimensions
An Edge-Based Framework for Enumerating 3-Manifold Triangulations
Manhattonian Proximity in a Simple Polygon
Finding Compact Coordinate Representations for Polygons and Polyhedra
The One-Way Communication Complexity of Dynamic Time Warping Distance
The voronoi diagram of three lines
Spanning Trees Crossing Few Barriers
Generalized Hidden Surface Removal
A Defect-Correction algorithm for Minimizing the Volume of a Simple Polyhedron Which Circumscribes a Sphere
On the maximum number of edges in topological graphs with no four pairwise crossing edges
Shape dimension and intrinsic metric from samples of manifolds with high co-dimension
Dynamic Geometric Connectivity in the Plane with Constant Query Time
Short Topological Decompositions of Non-Orientable Surfaces
Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension
Clusters of Stars
Single-strip triangulation of manifolds with arbitrary topology
Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version)
Applications of geometry and topology for quadrilateral meshprocessing and verifiable visualization
A Fast Planar Partition Algorithm, II