yusuke1997/dblp-id-title huggingface dataset:
On the plane angle-monotone graphs
On Counting Triangulations in D Dimensions
Minimum ply covering of points with disks and squares
On the number of crossing-free partitions
On triangulating three-dimensional polygons
Linkless symmetric drawings of series parallel digraphs
An improved algorithm for diameter-optimally augmenting paths in a metric space
On the complexity of umbra and penumbra
Time-varying Reeb graphs for continuous space-time data
Connectivity with directional antennas in the symmetric communication model
Art galleries with guards of uniform range of vision
Approximation algorithms for free-label maximization
Partial surface matching by using directed footprints
Flips in edge-labelled pseudo-triangulations
On topological graphs with at most four crossings per edge
Geometric dilation of closed curves in normed planes
On the complexity of orthogonal compaction
Reconstructing embedded graphs from persistence diagrams
Local, smooth, and consistent Jacobi set simplification
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time
Approximately matching polygonal curves with respect to the Fre'chet distance
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model
Fast reconstruction of Delaunay triangulations
Non-manifold surface reconstruction from high-dimensional point cloud data
Intersections with random geometric objects
Reprint of: Upward planar embedding of an n-vertex oriented path on O(n 2 ) points
Upward planar embedding of an n-vertex oriented path on O(n 2 ) points
A fast algorithm for approximating the detour of a polygonal chain
Preferred directions for resolving the non-uniqueness of Delaunay triangulations
An improved algorithm for reconstructing a simple polygon from its visibility angles
The optimality of a certain purely recursive dissection for a sequentially n-divisible square
Enumerating triangulation paths
An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
Negative Results on Characterizing Visibility Graphs
Expected time analysis for Delaunay point location
Optimally computing a shortest weakly visible line segment inside a simple polygon
Matching colored points in the plane: Some new results
Angle-Restricted Tours in the Plane
Largest and smallest area triangles on imprecise points
Approximating the volume of unions and intersections of high-dimensional geometric objects
A Convex Hull Algorithm for Discs, and Applications
New eyes for building models from video
An incremental algorithm for reconstruction of surfaces of arbitrary codimension
Minimizing support structures and trapped area in two-dimensional layered manufacturing
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
Guarding Polyhedral Terrains
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
Hamiltonian Triangulations and Circumscribing Polygons of Disjoint Line Segments
Reprint of: Theta-3 is connected
Computing the similarity between moving curves
Minimal Link Visibility Paths Inside a Simple Polygon
Space Reduction and an Extension for a Hidden Line Elimination Algorithm
On some geometric selection and optimization problems via sorted matrices
The vertex-edge visibility graph of a polygon
Computing Rectangle Enclosures
Coloring planar homothets and three-dimensional hypergraphs
A product inequality for extreme distances
Steiner reducing sets of minimum weight triangulations: Structure and topology
Shortest descending paths through given faces
Parallel searching on m rays
Convexity recognition of the union of polyhedra
Model-based Probing Strategies for Convex Polygons
Reprint of: Delaunay refinement algorithms for triangular mesh generation
Parallel Fractional Cascading on Hypercube Multiprocessors
Linear time algorithm for optimal feed-link placement
Shortest path problem in rectangular complexes of global nonpositive curvature
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Complexity results on untangling red-blue matchings
The impact of geometry on monochrome regions in the flip Schelling process
Spheres, molecules, and hidden surface removal
Computational analysis of mesh simplification using global error
Offset-polygon annulus placement problems
Median problem in some plane triangulations and quadrangulations
Drawing the Horton set in an integer grid of minimum size
The minimum Manhattan network problem: Approximations and exact solutions
A streaming algorithm for 2-center with outliers in high dimensions
Guarding curvilinear art galleries with vertex or point guards
Unfoldings and nets of regular polytopes
Matching point sets with respect to the Earth Mover's Distance
On incremental rendering of silhouette maps of a polyhedral scene
A fractional Helly theorem for boxes
Separating bichromatic point sets by L-shapes
Fast algorithms for approximate Fréchet matching queries in geometric trees
Guest Editor's foreword
Unfolding polycube trees with constant refinement
Efficient generation of triconnected plane triangulations
Acrophobic guard watchtower problem
Off-line Dynamic Maintenance of the Width of a Planar Point Set
Segment endpoint visibility graphs are Hamiltonian
The Minkowski sum of simplices in 3-dimensional space: An analytical description
Sequential dependency computation via geometric data structures
Orthogonal polygon reconstruction from stabbing information
Algorithms for graphs of bounded treewidth via orthogonal range searching
Expected asymptotically optimal planar point location
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
Flips in planar graphs
Universal hinge patterns for folding strips efficiently into any grid polyhedron
Characterization of Contour Elements That Generate Abstract Voronoi Diagrams
Approximation algorithm for the kinetic robust K-center problem
Topological inference of manifolds with boundary
Simple and optimal output-sensitive construction of contour trees using monotone paths
K-dominance in multidimensional data: Theory and applications
Approximation of convex figures by pairs of rectangles
Region-restricted clustering for geographic data mining
On a cone covering problem
Reprint of: Weighted straight skeletons in the plane
An almost linear time algorithm for field splitting in radiation therapy
Largest bounding box, smallest diameter, and related problems on imprecise points
Mathematical model and efficient algorithms for object packing problem
Shortest path planning for a tethered robot
A polygon is determined by its angles
Survivable minimum bottleneck networks
Lower bounds on the number of crossing-free subgraphs of K N
Using generic programming for designing a data structure for polyhedral surfaces
A Computationally Intractable Problem on Simplicial Complexes
Determining Maximum K-width-connectivity on Meshes
Almost all Delaunay triangulations have stretch factor greater than pi/2
Tiling space and slabs with acute tetrahedra
Pattern formation for fat robots with lights
Compact and low delay routing labeling scheme for Unit Disk Graphs
Flattening single-vertex origami: The non-expansive case
Routing in polygonal domains
A new lower bound on the maximum number of plane graphs using production matrices
Hinged dissection of polyominoes and polyforms
Approximating dominating set on intersection graphs of rectangles and L-frames
Universal 3-dimensional visibility representations for graphs
Pushing blocks is hard
Hierarchy of surface models and irreducible triangulations
Special Issue on the 28th European Workshop on Computational Geometry, Guest Editors' Foreword
The largest k-ball in a d-dimensional box
A generic software design for Delaunay refinement meshing
Closest-pair queries in fat rectangles
Compatible spanning trees
Randomized Incremental Construction of Abstract Voronoi Diagrams
An efficient local approach to convexity testing of piecewise-linear hypersurfaces
Covering convex polygons by two congruent disks
An optimal randomized algorithm for d-variate zonoid depth
Faradžev Read-type enumeration of non-isomorphic CC systems
New bounds on the maximum number of edges in k-quasi-planar graphs
Self-approaching paths in simple polygons
Query point visibility computation in polygons with holes
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited
Efficient segment folding is hard
Parallel Searching in the Plane
Piercing families of convex sets in the plane that avoid a certain subfamily with lines
Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon
Distinct Distances Determined By Subsets of a Point Set in Space
Edge guards in rectilinear polygons
Watchman Routes Under Limited Visibility
Between shapes, using the Hausdorff distance
On representations of some thickness-two graphs
Computing the visibility map of fat objects
Erratum to: "Densest Lattice Packings of 3-Polytopes" [Computational Geometry 16 (2000) 157-186]
Guarding orthogonal art galleries with sliding cameras
Point sets with many non-crossing perfect matchings
Special issue on geometric constraints and reasoning
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
Counting triangulations and other crossing-free structures approximately
Beta-skeletons have unbounded dilation
On prescribing total orders and preorders to pairwise distances of points in Euclidean space
Isometric deformations of discrete and smooth T-surfaces
Thread-parallel mesh improvement using face and edge swapping and vertex insertion
Maximum-area and maximum-perimeter rectangles in polygons
Connected matchings
Edge guards for polyhedra in three-space
On algorithmic complexity of imprecise spanners
Convexity-increasing morphs of planar graphs
Separating families of convex sets
Sets of lines and cutting out polyhedral objects
On the approximability of covering points by lines and related problems
Memory-constrained algorithms for simple polygons
Outerplanar graph drawings with few slopes
Reversibility properties of the fire-fighting problem in graphs
Enumerating topological (n k )-configurations
Distinct distances between points and lines
Geometric Orderings of Intersecting Translates and Their Applications
A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion
LMT-skeleton heuristics for several new classes of optimal triangulations
Drawing outerplanar graphs using thirteen edge lengths
Computing Minimum Length Paths of a Given Homotopy Class
Hamiltonicity for convex shape Delaunay and Gabriel graphs
The hamburger theorem
Hamilton cycles in the path graph of a set of points in convex position
Approximating majority depth
Reporting curve segment intersections using restricted predicates
Computing a visibility polygon using few variables
Algorithms for computing closest points for segments
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties
Densest translational lattice packing of non-convex polygons
Packing polyominoes clumsily
Closest pair and the post office problem for stochastic points
A Linear-time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation
Bold graph drawings
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
Influence-based Voronoi diagrams of clusters
On the Recognition of Digital Circles in Linear Time
r-regular shape reconstruction from unorganized points
Design of solids for antigravity motion illusion
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
Reprint of: Optimally solving a transportation problem using Voronoi diagrams
Evacuating equilateral triangles and squares in the face-to-face model
Interactive texture mapping for polygonal models
Bichromatic 2-center of pairs of points
Simplex closing probabilities in directed graphs
On reconfiguration of disks in the plane and related problems
Range updates and range sum queries on multidimensional points with monoid weights
An efficient three-dimensional face recognition system based random forest and geodesic curves
On Optimal Guillotine Partitions Approximating Optimal D-box Partitions
Orthogonal graph drawing with inflexible edges
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
The one-round Voronoi game replayed
Continuous flattening of all polyhedral manifolds using countably infinite creases
A Practical Map Labeling Algorithm
Inapproximability of finding maximum hidden sets on polygons and terrains
Probing Polygons Minimally Is Hard
Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons
The ordinary line problem revisited
Distance queries over dynamic interval graphs
Watchman routes for lines and line segments
Planar rectilinear drawings of outerplanar graphs in linear time
Reprint of: Memory-constrained algorithms for simple polygons
Minimizing the Sum of Diameters Efficiently
Dynamic data structures for fat objects and their applications
Edge Guarding Polyhedral Terrains
Approximate range searching: The absolute model
On the expected diameter, width, and complexity of a stochastic convex hull
A note on empty balanced tetrahedra in two-colored point sets in R3
On the approximation of shortest escape paths
Maximum-width rainbow-bisecting empty annulus
Approximating the rectilinear crossing number
Orthogonal range searching in linear and almost-linear space
Adaptive spacetime meshing for discontinuous Galerkin methods
Combinatorial aspects of geometric graphs
On Euclidean vehicle routing with allocation
Extremal convex polygons inscribed in a given convex polygon
Constrained higher order Delaunay triangulations
Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]
Advanced programming techniques applied to Cgal's arrangement package
Guest Editors' foreword
Computing a minimum-dilation spanning tree is NP-hard
Representing Polyhedra: Faces Are Better Than Vertices
Computing maximum independent set on outerstring graphs and their relatives
An improved upper bound on dilation of regular polygons
Long proteins with unique optimal foldings in the H-P model
Experiments with unit disk cover algorithms for covering massive pointsets
On embedding an outer-planar graph in a point set
Visibility and ray shooting queries in polygonal domains
Rectangular drawing of cubic graphs on an annulus and a Möbius band
Distance k-sectors exist
Kinetic collision detection between two simple polygons
Discrete Voronoi games and ϵ-nets, in two and three dimensions
Getting around a lower bound for the minimum Hausdorff distance
A simple linear algorithm for computing rectilinear 3-centers
On the stretch factor of Delaunay triangulations of points in convex position
Sequences of spanning trees and a fixed tree theorem
Recursive geometry of the flow complex and topology of the flow complex filtration
Practical methods for approximating shortest paths on a convex polytope in R3
Point labeling with sliding labels
On crossing-families in planar point sets
Translating a convex polyhedron over monotone polyhedra
Faster geometric algorithms via dynamic determinant computation
On the area requirements of Euclidean minimum spanning trees
A quadratic distance bound on sliding between crossing-free spanning trees
A dihedral acute triangulation of the cube
Pointed drawings of planar graphs
Colored spanning graphs for set visualization
Maximum inscribed and minimum enclosing tropical balls of tropical polytopes and applications to volume estimation and uniform sampling
Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions
Chromatic nearest neighbor searching: A query sensitive approach
Holes in 2-convex point sets
Finding minimum witness sets in orthogonal polygons
Optimal triangulation and quadric-based surface simplification
Distance measures for geometric graphs
An O(n 5/2 logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
Guarding disjoint triangles and claws in the plane
Algorithms for optimal area triangulations of a convex polygon
On the minimum-area rectangular and square annulus problem
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Hidden Surface Removal for C-oriented Polyhedra
Approximate centerpoints with proofs
Geometric applications of posets
Angles of arc-polygons and Lombardi drawings of cacti
On guarding the vertices of rectilinear domains
Optimal location of transportation devices
Farthest-point queries with geometric and combinatorial constraints
A note on the minimum number of red lines needed to pierce the intersections of blue lines
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
Sparse geometric graphs with small dilation
Kinetic and dynamic data structures for convex hulls and upper envelopes
A (1+)-approximation algorithm for 2-line-center
Optimally solving a transportation problem using Voronoi diagrams
Similarity of polygonal curves in the presence of outliers
Art gallery theorems for guarded guards
Depth of segments and circles through points enclosing many points: a note
On reverse shortest paths in geometric proximity graphs
Guaranteed quality tetrahedral Delaunay meshing for medical images
A Helly-type theorem for higher-dimensional transversals
Improved PTASs for convex barrier coverage
Dynamic data structures for k -nearest neighbor queries
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems
An Edgebreaker-based efficient compression scheme for regular meshes
Guarantees on nearest-neighbor condensation heuristics
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Multiresolution banded refinement to accelerate surface reconstruction from polygons
Optimal bit allocation in compressed 3D models
Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
Computing homotopic line simplification
Pattern formation for fat robots with memory
Dihedral deformation and rigidity
Approximating average bounded-angle minimum spanning trees
Hausdorff approximation of convex polygons
Tilings of the regular N -gon with triangles of angles π / N , π / N , ( N - 2) π / N for N = 5, 8, 10 and 12
Equiprojective polyhedra
Tighter estimates for ϵ-nets for disks
Planar rectilinear shortest path computation using corridors
On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees
Approximating polyhedral objects with deformable smooth surfaces
Many disjoint edges in topological graphs
Faster bottleneck non-crossing matchings of points in convex position
Computing the Fréchet distance between piecewise smooth curves
On full Steiner trees in unit disk graphs
Faster Geometric K-point MST Approximation
The geodesic 2-center problem in a simple polygon
Reachability by paths of bounded curvature in a convex polygon
Graph of triangulations of a convex polygon and tree of triangulations
Efficient external memory structures for range-aggregate queries
A geometric condition for uniqueness of Fréchet means of persistence diagrams
Finding largest rectangles in convex polygons
Combinatorial Face Enumeration in Convex Polytopes
1-planarity testing and embedding: An experimental study
A note on the unsolvability of the weighted region shortest path problem
Bottleneck matching in the plane
Triangulations from topologically correct digital Voronoi diagrams
The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles
Orthogonal drawings of graphs with vertex and edge labels
Sum of edge lengths of a multigraph drawn on a convex polygon
On a Counterexample to a Conjecture of Mirzaian
Variants for the Hough Transform for Line Detection
Reporting intersecting pairs of convex polytopes in two and three dimensions
Only distances are required to reconstruct submanifolds
Elastic geometric shape matching for translations under the Manhattan norm
Partially walking a polygon
Computation of spatial skyline points
Distinct distances between a line and strip
Half-plane point retrieval queries with independent and dependent geometric uncertainties
Improved algorithms for the bichromatic two-center problem for pairs of points
Space/query-time tradeoff for computing the visibility polygon
Editorial CCCG 2005
A Tverberg-type result on multicolored simplices
Routing in a polygonal terrain with the shortest beacon watchtower
Translating a regular grid over a point set
On point-sets that support planar graphs
Any platonic solid can transform to another by O (1) refoldings
Wrapping spheres with flat paper
Triangulations without pointed spanning trees
Bumpy pyramid folding
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
Multivariate topology simplification
Rectangular Spiral Galaxies are still hard
Improved bounds for cops-and-robber pursuit
Proximity drawings in polynomial area and volume
Geodesic obstacle representation of graphs
On exact covering with unit disks
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
Symmetric connectivity with directional antennas
A note on multicovering with disks
Universality of persistence diagrams and the bottleneck and Wasserstein distances
Improved approximation for two-dimensional vector multiple knapsack
Protecting critical facets in layered manufacturing
Maximum-width empty square and rectangular annulus
Classroom examples of robustness problems in geometric computations
A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons
Matching points with rectangles and squares
Normal cone approximation and offset shape isotopy
(Weakly) Self-approaching geometric graphs and spanners
Integrating volume morphing and visualization
Packing unequal disks in the Euclidean plane
Erased arrangements of lines and convex decompositions of polyhedra
On the geometric dilation of closed curves, graphs, and point sets
ote on an art gallery problem
Flip distance between triangulations of a planar point set is APX-hard
Combinatorial and experimental results for randomized point matching algorithms
Cgta
Fast Fréchet queries
Shape matching under rigid motion
Efficient algorithms for computing Reeb graphs
T-shape visibility representations of 1-planar graphs
The class cover problem with boxes
Computing homotopic shortest paths efficiently
Visibility maps of segments and triangles in 3D
Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position
On upward point set embeddability
On counting point-hyperplane incidences
Analysis of farthest point sampling for approximating geodesics in a graph
Determining Bar-representability for Ordered Weighted Graphs
The distance geometry of music
Keep your distance: Land division with separation
An algorithm for the maximum weight independent set problem on outerstring graphs
Two optimization problems for unit disks
Voronoi drawings of trees
A Deterministic Algorithm for the Three-dimensional Diameter Problem
A linear-space algorithm for distance preserving graph embedding
On the existence of ordinary triangles
Decomposing filtered chain complexes: Geometry behind barcoding algorithms
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
On approximating the Riemannian 1-center
Computing straight-line 3D grid drawings of graphs in linear volume
Embeddability of open-ended carbon nanotubes in hypercubes
Minimum-width double-slabs and widest empty slabs in high dimensions
On the minimum total length of interval systems expressing all intervals, and range-restricted queries
An output sensitive algorithm for discrete convex hulls
Generalized class cover problem with axis-parallel strips
Bottleneck partial-matching Voronoi diagrams and applications
On the structure of extremal point-line arrangements
Casting a polyhedron with directional uncertainty
Parallel computation of alpha complexes for biomolecules
Approximating the packedness of polygonal curves
Crossing lemma for the odd-crossing number
Efficient reconfiguration of lattice-based modular robots
Normal art galleries: Wall in - all in