yusuke1997/dblp-id-title huggingface dataset:
A Rational Rotation Method for Robust Geometric Algorithms
Curve-sensitive cuttings
Optimal Shortest Path Queries in a Simple Polygon
Multinerves and helly numbers of acyclic families
Reconstructing sharp features of triangular meshes
Optimal decomposition of polygonal models into triangle strips
Exact L infty Nearest Neighbor Search in High Dimensions
Rectangular cartograms: the game
Products of Euclidean Metrics and Applications to Proximity Questions among Curves
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves
Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage
Sampling in dynamic data streams and applications
Decomposing Multiparameter Persistence Modules
Convexification of polygons by length preserving transformations
Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution)
Edge Collapse and Persistence of Flag Complexes
Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition)
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inR d
Subdivisions of n -Dimensional Spaces and n -Dimensional Generalized Maps
On the Chromatic Number of Disjointness Graphs of Curves
Computing persistent homology
Visualization of discrete gradient construction
Strange Random Topology of the Circle
Computing a Link Diagram from Its Exterior
Putting the turing into manufacturing: recent developments in algorithmic automation
Shelling and Sinking Graphs on the Sphere
Probabilistic embeddings of bounded genus graphs into planar graphs
New Bounds on Crossing Numbers
Cardiac Trabeculae Segmentation: an Application of Computational Topology (Multimedia Contribution)
Temporally Coherent Conservative Visibility (Extended Abstract)
Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data
Voronoi diagrams based on convex distance functions
A Universal Triangulation for Flat Tori
How to Make a CG Video (Media Exposition)
Distributed vision with smart pixels
Chains, Koch Chains, and Point Sets with Many Triangulations
Tangencies between families of disjoint regions in the plane
Efficient and small representation of line arrangements with applications
Shooting permanent rays among disjoint polygons in the plane
Searching for Empty Convex Polygons
A Framework for Dynamic Graph Drawing
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
On Planar Greedy Drawings of 3-Connected Planar Graphs
Delaunay triangulations of point sets in closed euclidean d-manifolds
Candle in the woods: asymptotic bounds on minimum blocking sets
Super-Polynomial Growth of the Generalized Persistence Diagram
Dynamic Planar Point Location in External Memory
Counting crossing-free structures
An Aspect Ratio Bound for Triangulating a d -Grid Cut by a Hyperplane (Extended Abstract)
Mesh generation for domains with small angles
Coordinated Motion Planning: The Video (Multimedia Exposition)
Fast Collision Detection Among Multiple Moving Spheres
Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000
Binary plane partitions for disjoint line segments
Epsilon nets and union complexity
Two-Sided Kirszbraun Theorem
Simplification of Trajectory Streams
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
The Universal ℓ p -Metric on Merge Trees
Random sampling in geometric optimization: new insights and applications
Maintaining Contour Trees of Dynamic Terrains
No-Dimensional Tverberg Theorems and Algorithms
Back-Face Computation of Polygon Clusters
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles
On the Separability of Stochastic Geometric Objects, with Applications
An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm
Faster Approximation Algorithms for Geometric Set Cover
Light spanners for Snowflake Metrics
Recipes for Geometry and Numerical Analysis - Part I: An Empirical Study
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993
The Graph of Triangulations of a Convex Polygon
Euclidean TSP in Narrow Strips
Embedding and similarity search for point sets under translation
Equal coefficients and tolerance in coloured tverberg partitions
Quickest Visibility Queries in Polygonal Domains
A Topological Version of Schaefer's Dichotomy Theorem
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999
the asteroid surveying problem and other puzzles
A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space
Approximating low-dimensional coverage problems
Computational origami: from flapping birds to space telescopes
Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract)
Vertical ray shooting for fat objects
Competitive Searching in a Generalized Street
Efficient Hidden Surface Removal for Objects with small Union Size
Worst-Case Optimal Covering of Rectangles by Disks
An 11/6-Approximation Algorithm for Vertex Cover on String Graphs
Trajectory Grouping Structure: the Video
Computing Euclidean Maximum Spanning Trees
Gromov-Hausdorff Approximation of Filament Structure Using Reeb-type Graph
A Compaction Algorithm for Non-Convex Polygons and Its Application
Extreme elevation on a 2-manifold
Dynamic Streaming Algorithms for Epsilon-Kernels
Metamorphosis of the Cube
Online geometric reconstruction
Detecting and Decomposing Self-Overlapping Curves
On approximate halfspace range counting and relative epsilon-approximations
Visualizing Quickest Visibility Maps
On grids in topological graphs
Polyominoes on twisted cylinders
Tight bounds for connecting sites across barriers
Enclosing Points with Geometric Objects
Periodic body-and-bar frameworks
Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons
Searching with an autonomous robot
A Parallel Algorithm for Linear Programming in Fixed Dimension
Efficient Computation of Image Persistence
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs
Discrete Stratified Morse Theory: A User's Guide
A scalable simulator for forest dynamics
A Subquadratic Algorithm for Computing the L₁-Distance Between Two Terrains
Vertex-Rounding a Three-Dimensional Polyhedral Subdivision
Robust and Efficient Evaluation of Functionals on Parametric Surfaces
Rods and Rings: Soft Subdivision Planner for R^3 x S^2
Implementation of a Motion Planning System in Three Dimensions
The Density Fingerprint of a Periodic Point Set
Adaptive mesh generation for real-time terrain modeling
Sampling and meshing a surface with guaranteed topology and geometry
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
Long Non-Crossing Configurations in the Plane
The least spanning area of a knot and the optimal bounding chain problem
The skip quadtree: a simple dynamic data structure for multidimensional data
Efficient Exact Arithmetic for Computational Geometry
Computing hereditary convex structures
Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992
An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization
Answering geographic questions with user generated content: experiences from the coal face
Combinatorial Complexity of Translating a Box in Polyhedral 3-Space
On Helly Numbers of Exponential Lattices
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements
Sketched MinDist
Halving lines and measure concentration in the plane
Interval Methods for Kinetic Simulations
Self-improving algorithms for coordinate-wise maxima
Approximate nearest neighbor algorithms for Frechet distance via product metrics
Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension
A PTAS for k-means clustering based on weak coresets
An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification
Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations
Visibility and intersectin problems in plane geometry
On Computing the Intersection of B-Splines (Extended Abstract)
Clustering with Few Disks to Minimize the Sum of Radii
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Establishing Order in Planar Subdivisions
On the Sectional Area of Convex Polytopes
Geometric Realizations of Dichotomous Ordinal Graphs
Fixed Points of the Restricted Delaunay Triangulation Operator
A Toroidal Maxwell-Cremona-Delaunay Correspondence
Shortest Paths in Portalgons
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications
A geometric framework for solving subsequence problems in computational biology efficiently
Moving a Ladder in Three Dimensions: Upper and Lower Bounds
Dimensionality of Hamming Metrics and Rademacher Type
Persistence-sensitive simplification functions on 2-manifolds
On the partitionability of point sets in space (preliminary report)
A Bézier-based approach to unstructured moving meshes
Necessary and Sufficient Conditions for Hyperplane Transversals
Contact representations of planar graphs with cubes
Fast Heuristics for Minimum Length Rectangular Partitions of Polygons
Some New Bounds for Epsilon-Nets
A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra
Algorithmic complexity of finding cross-cycles in flag complexes
Distinct distances on algebraic curves in the plane
Computing Representative Networks for Braided Rivers
Independent Range Sampling, Revisited Again
Dots & Polygons (Media Exposition)
The Extensible Drawing Editor Ipe
Pushing squares around
A local search approximation algorithm for k-means clustering
Oriented Projective Geometry
Orthogonal range searching on the RAM, revisited
Multi-pass geometric algorithms
The Complexity of Geodesic Spanners
Systems of distant representatives in euclidean space
Time-varying reeb graphs for continuous space-time data
Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments
Walking your dog in the woods in polynomial time
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
Combinatorial genericity and minimal rigidity
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs
Lower Bounds for Intersection Reporting Among Flat Objects
Cost-driven octree construction schemes: an experimental study
Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings
Tracing compressed curves in triangulated surfaces
Liftings and stresses for planar periodic frameworks
Rectilinear Steiner Trees in Narrow Strips
Pareto envelopes in R 3 under l 1 and l infinity distance functions
A Computational Basis for Higher-Dimensional Computational Geometry and Applications
Approximating the centroid is hard
Fast enumeration algorithms for non-crossing geometric graphs
There are not too many magic configurations
ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices
The Degree-Rips Complexes of an Annulus with Outliers
Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane
Incremental constructions con BRIO
Efficient Collision Detection for Moving Polyhedra
Hanani-Tutte for Approximating Maps of Graphs
Lipschitz Decompositions of Finite 𝓁 p Metrics
Efficient Exact Evaluation of Signs of Determinants
Degree Complexity Bounds on the Intersection of Algebraic Curves
Geometric Secluded Paths and Planar Satisfiability
Computing and Verifying Depth Orders
Volume distortion for subsets of Euclidean spaces: extended abstract
GASP-II - A Geometric Algorithm Animation System for an Electronic Classroom
An output-sensitive algorithm for computing projections of resultant polytopes
A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
Heilbronn's triangle problem
The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances
Cross-Ratios and Angles Determine a Polygon
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ²
Visualizing Lucas's Hamiltonian Paths Through the Associahedron 1-Skeleton (Media Exposition)
Configurations of Lines in 3-Space and Rigidity of Planar Structures
Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams
CSG Set-Theoretic Solid Modelling and NC Machining of Blend Aurfaces
Computing the Visibility Graph via Pseudo-Triangulations
Consistent Sets of Lines with no Colorful Incidence
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
Visualizing hyperbolic Voronoi diagrams
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons
Improved approximation algorithms for geometric set cover
A -Shapes of a Finite Point Set
Spheres, Molecules, and Hidden Surface Removal
Fault-tolerant geometric spanners
Polynomial-Sized Topological Approximations Using the Permutahedron
Semi-Algebraic Colorings of Complete Graphs
Polychromatic colorings of plane graphs
The criss-cross method can take Omega(n d ) pivots
The tidy set: a minimal simplicial set for computing homology of clique complexes
The analysis of a simple k -means clustering algorithm
A Census of Plane Graphs with Polyline Edges
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
On Variants of k-means Clustering
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains
Viewspace Partitioning of Densely Occluded Scenes
Animation of an Algorithm for Drawing Graphs in 3D
Testing Convexity of Figures Under the Uniform Distribution
Cutting glass
A Unified Approach to Labeling Graphical Features
Strategies for Polyhedral Surface Decomposition: An Experimental Study
Dynamic Orthogonal Range Searching on the RAM, Revisited
Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design
Estimating surface normals in noisy point cloud data
Disjoint compatible geometric matchings
Toward Pervasive Robots (Invited Talk)
A Comparison of Sequential Delaunay Triangulation Algorithms
Distance k -sectors exist
A geometric reasoning system for moving an object while maintaining contact with others
Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size
Software for the Thompson and Funk Polygonal Geometry (Media Exposition)
Robustly Guarding Polygons
Nice point sets can have nasty Delaunay triangulations
Beating the spread: time-optimal point meshing
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract)
Algorithms for Metric Learning via Contrastive Embeddings
Practical Software for Triangulating and Simplifying 4-Manifolds
Minkowski sums of rotating convex polyhedra
New Lower Bounds for Convex Hull Problems in Odd Dimensions
On the complexity of sets of free lines and line segments among balls in three dimensions
Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex
A near-optimal algorithm for shortest paths among curved obstacles in the plane
The density of iterated crossing points and a gap result for triangulations of finite point sets
Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions d ≥ 4
Algorithms for congruent sphere packing and applications
Parametric search visualization
Ramsey-Type Results for Geometric Graphs II
Geodesic ham-sandwich cuts
Surface patches from unorganized space curves
A prototype system for visualizing time-dependent volume data
Dynamic Distribution-Sensitive Point Location
Blending Quadric Surfaces with Wuadric and Cubic Surfaces
Optimal Algorithm for the Planar Two-Center Problem
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem
Dynamic Maintenance of Maximas of 2-P Point Sets
Some Geometric Applications of Dilworth's Theorem
Detecting undersampling in surface reconstruction
Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes
Stable snap rounding
Efficient Motion Planning for an L-Shaped Object
Smooth surface reconstruction via natural neighbour interpolation of distance functions
A Lower Bound on Opaque Sets
Optimal Motion Planning for Two Square Robots in a Rectilinear Environment
Finding Closed Quasigeodesics on Convex Polyhedra
The 2-page crossing number of K n
Billboard clouds
Drawing Closed Rational Surfaces
Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited
An Animation of Euclid's Proposition 47: The Pythagorean Theorem
Visibility preserving terrain simplification: an experimental study
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Hyperorthogonal Well-Folded Hilbert Curves
Odd Yao-Yao Graphs are Not Spanners
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract)
Markov incremental constructions
On Higher Dimensional Point Sets in General Position
Polytope Offsets and Straight Skeletons in 3D
Coloring Curves That Cross a Fixed Curve
Range Counting Oracles for Geometric Problems
Combinatorial Depth Measures for Hyperplane Arrangements
Nearly Orthogonal Sets over Finite Fields
When crossings count - approximating the minimum spanning tree
Computing shortest paths among curved obstacles in the plane
A method for drawing graphs
Two-Point L1 Shortest Path Queries in the Plane
Collision detection for deforming necklaces
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions)
Flipping Geometric Triangulations on Hyperbolic Surfaces
Computing the volume of the union of cubes
A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set
Routing a maximum number of disks through a scene of moving obstacles
Clustered planarity
Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs)
On degrees in random triangulations of point sets
Bi-criteria linear-time approximations for generalized k-mean/median/center
A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves
Continuously Flattening Polyhedra Using Straight Skeletons
On Enumerating and Selecting Distances
Graph Reconstruction by Discrete Morse Theory
Minimum cuts and shortest homologous cycles
Video: Objects that Cannot be Taken Apart with Two Hands
A simple aggregative algorithm for counting triangulations of planar point sets and related problems
Recognizing 2-Layer and Outer k-Planar Graphs
The Union of Balls and Its Dual Shape
A simple algorithm for homeomorphic surface reconstruction
Cylindrical Static and Kinetic Binary Space Partitions
Edge flips and deforming surface meshes
Compatible Tetrahedralizations
An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space
Geometric Partitioning Made Easier, Even in Parallel
The Stretch Factor of Hexagon-Delaunay Triangulations
On the Planar Two-Center Problem and Circular Hulls
Spatial embedding of pseudo-triangulations
An IP solution to the art gallery problem
Computing the Discrepancy
Sparsification of the Generalized Persistence Diagrams for Scalability Through Gradient Descent
A data structure for multi-dimensional range reporting
A Graph Based Approach to Object Feature Recognition
I/O-efficient computation of water flow across a terrain
Counting Polygon Triangulations is Hard
A Fast Algorithm for Constructing Sparse Euclidean Spanners
Morse Theory for the k-NN Distance Function
Zone diagrams in Euclidean spaces and in other normed spaces
Binary space partitions of orthogonal subdivisions
Disjointness Graphs of Short Polygonal Chains
Better bounds on the union complexity of locally fat objects
36th International Symposium on Computational Geometry, SoCG 2020, Zürich, Switzerland, June 23-26, 2020
1-link shortest paths in weighted regions
Journey to the Center of the Point Set
Kinetic 3D convex hulls via self-adjusting computation
Range counting over multidimensional data streams
Efficient Algorithms for Ortho-Radial Graph Drawing
Image Triangulation Using the Sobel Operator for Vertex Selection (Media Exposition)
DTM-Based Filtrations
Sweeping Arrangements of Non-Piercing Regions in the Plane
Lower Bounds for Electrical Reduction on Surfaces
Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract)
Qualitative Symbolic Perturbation
Incidences Between Points and Curves with Almost Two Degrees of Freedom
Box-trees and R-trees with near-optimal query time
On the number of k-rich transformations
Adaptive Planar Point Location
The Number of Edges in Maximal 2-Planar Graphs
Analyzing Surfaces: The Truth About Elimination Theory
Dynamic Connectivity in Disk Graphs
The maximum number of faces of the minkowski sum of three convex polytopes
32nd International Symposium on Computational Geometry, SoCG 2016, Boston, MA, USA, June 14-18, 2016
Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction Algorithm
TSP With Locational Uncertainty: The Adversarial Model
Simplified Voronoi Diagrams
Computing cartograms with optimal complexity
Efficient Algorithms for Maximum Regression Depth
Bounding Helly Numbers via Betti Numbers
The geometry of flocking
A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes
Characterizing Universal Reconfigurability of Modular Pivoting Robots
A tight bound for the number of different directions in three dimensions
Lang's universal molecule algorithm
VASCO: visualizing and animating spatial constructs and operations
Who Needs Crossings? Hardness of Plane Graph Rigidity
On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
Discrete laplace operator on meshed surfaces
Exact Algorithms for Terrain Guarding
Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane
Plane Hamiltonian Cycles in Convex Drawings
The point-set embeddability problem for plane graphs
Simplifying a polygonal subdivision while keeping it simple
Polychromatic Coloring of Tuples in Hypergraphs
Look - a Lazy Object-Oriented Kernel for geometric computation
Optimum Watchman Routes
Radiosity in Flatland Made Visibly Simple: Using the Visibility Complex for Lighting Simulation of Dynamic Scenes in Flatland
New Competitive Strategies for Searching in Unknown Star-Shaped Polygons
Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)
Towards in-place geometric algorithms and data structures
Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition
Path Planning for Simple Robots using Soft Subdivision Search
Proximity Problems on Moving Points
Efficient Approximation of the Matching Distance for 2-Parameter Persistence
On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon
Constrained Triangulations, Volumes of Polytopes, and Unit Equations
Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems
The complexity of the outer face in arrangements of random segments
Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons
Efficient computation of query point visibility in polygons with holes
Guarding polyominoes
Nearest Neighbor Searching in a Dynamic Simple Polygon
Sketching Persistence Diagrams
Fast Geometric Approximation Techniques and Geometric Embedding Problems
Towards Implementing Robust Geometric Computations
Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions
34th International Symposium on Computational Geometry, SoCG 2018, Budapest, Hungary, June 11-14, 2018
Rotational Polygon Overlap Minimization
On Detecting the Orientation of Polygons and Polyhedra
Cut locus and topology from surface point data