yusuke1997/dblp-id-title huggingface dataset:
A lower bound for computing geometric spanners
Efficient planar two-center algorithms
Colored ray configurations
Compatible geometric matchings
Curvature based shape detection
A proof of the Oja depth conjecture in the plane
Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
Drawing cubic graphs with at most five slopes
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
Practical segment intersection with finite precision output
Parameterized inapproximability of Morse matching
Bottleneck non-crossing matching in the plane
On the separability of stochastic geometric objects, with applications
Shortcut hulls: Vertex-restricted outer simplifications of polygons
Proximity problems on line segments spanned by points
Erds Distance Problems in Normed Spaces
On Parallel Rectilinear Obstacle- Avoiding Paths
Algorithms for Proximity Problems in Higher Dimensions
Fast segment insertion and incremental construction of constrained Delaunay triangulations
Checking the convexity of polytopes and the planarity of subdivisions
External Polygon Containment Problems
Separability of imprecise points
Piercing pairwise intersecting geodesic disks by five points
The dispersive art gallery problem
Drawing planar 3-trees with given face areas
Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom
Competitive searching in a generalized street
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
Characterizing LR-visibility polygons and related problems
Saturated simple and k-simple topological graphs
Covering points with orthogonally convex polygons
Geometric firefighting in the half-plane
An exact and efficient approach for computing a cell in an arrangement of quadrics
Efficient visibility queries in simple polygons
Rotational polygon overlap minimization and compaction
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
Exact algorithms and APX-hardness results for geometric packing and covering problems
An inequality on the edge lengths of triangular meshes
Approximation algorithms for lawn mowing and milling
Rearranging a sequence of points onto a line
Weighted skeletons and fixed-share decomposition
A better heuristic for orthogonal graph drawings
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
On the zone of the boundary of a convex body
Algorithms for radius-optimally augmenting trees in a metric space
Approximation algorithms for 1-Wasserstein distance between persistence diagrams
Steiner hull algorithm for the uniform orientation metrics
Lower bounds in on-line geometric searching
An algorithm for constructing star-shaped drawings of plane graphs
Voronoi Diagrams on Orbifolds
Solving the natural wireless localization problem to optimality efficiently
Smallest universal covers for families of triangles
Density of triangulated ternary disc packings
The MST of symmetric disk graphs is light
Polygon decomposition for efficient construction of Minkowski sums
On simplifying dot maps
Witness (Delaunay) graphs
Rotationally optimal spanning and Steiner trees in uniform orientation metrics
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
Orthogonal cartograms with at most 12 corners per face
A package for exact kinetic data structures and sweepline algorithms
Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem
The constant of point-line incidence constructions
When can you fold a map?
On the shortest separating cycle
Speeding up the incremental construction of the union of geometric objects in practice
On the Fermat-Weber center of a convex object
Near equipartitions of colored point sets
Local transformations of hexahedral meshes of lower valence
Coloring half-planes and bottomless rectangles
Linear time approximation of 3D convex polytopes
The vertex set of a 0/1-polytope is strongly P-enumerable
Computing minimum-area rectilinear convex hull and L-shape
Global strong convexity and characterization of critical points of time-of-arrival-based source localization
Flip distance between two triangulations of a point set is NP-complete
Union and split operations on dynamic trapezoidal maps
Interlocked open and closed linkages with few joints
On k-convex point sets
Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation
Efficient c-oriented range searching with DOP-trees
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces
Common developments of three incongruent boxes of area 30
Surface reconstruction using umbrella filters
Controlled Perturbation of sets of line segments in ℝ 2 with smart processing order
Empty rainbow triangles in k -colored point sets
Delaunay refinement algorithms for triangular mesh generation
Complexity of the minimum-length corridor problem
Algorithms for the line-constrained disk coverage and related problems
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
Linear-time Algorithms for Weakly-monotone Polygons
Line segment visibility with sidedness constraints
Concatenation arguments and their applications to polyominoes and polycubes
A near linear time approximation scheme for Steiner tree among obstacles in the plane
An adaptable and extensible geometry kernel
Linear reconfiguration of cube-style modular robots
Linear area upward drawings of AVL trees
Approximating the bottleneck plane perfect matching of a point set
Augmenting the connectivity of geometric graphs
Approximating minimum bending energy path in a simple corridor
Overlap of convex polytopes under rigid motion
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions
Formal specification and proofs for the topology and classification of combinatorial surfaces
On the degree of standard geometric predicates for line transversals in 3D
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
Approximating geodesic distances on 2-manifolds in R 3
Linear-time approximation scheme for k -means clustering of axis-parallel affine subspaces
Quality mesh generation for molecular skin surfaces using restricted union of balls
Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device
Convex Polygons with Few Intervertex Distances
How Good Are Convex Hull Algorithms?
A linear time algorithm for approximate 2-means clustering
Time-space trade-offs for triangulations and Voronoi diagrams
Strong matching of points with geometric shapes
The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version
Algorithms for bivariate medians and a Fermat-Torricelli problem for lines
Spiderman graph: Visibility in urban regions
Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword
On the density of iterated line segment intersections
RAPID: Randomized pharmacophore identification for drug design
On the power of the semi-separated pair decomposition
The affine representation theorem for abstract convex geometries
Temporally coherent conservative visibility
Maximizing the maximum degree in ordered nearest neighbor graphs
A unified and efficient solution to the room search problem
Cooperative mobile guards in grids
Maximal and Minimal Balls
A decade of CGAL
Packing two disks in a polygon
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees
Towards a definition of higher order constrained Delaunay triangulations
Bisecting three classes of lines
Note on k-planar crossing numbers
Matched drawability of graph pairs and of graph triples
On the Multisearching Problem for Hypercubes
Distance-preserving approximations of polygonal paths
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
An O(nlogn) algorithm for the zoo-keeper's problem
Computing the L1 geodesic diameter and center of a simple polygon in linear time
Modem illumination of monotone polygons
Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-space
A Kuratowski-type theorem for planarity of partially embedded graphs
A dense planar point set from iterated line intersections
Finding minimum hidden guard sets in polygons - tight approximability results
On crossing numbers of geometric proximity graphs
Geometric permutations of higher dimensional spheres
Approximating geodesic distances on 2-manifolds in R 3 : The weighted case
On optimal disc covers and a new characterization of the Steiner center
Geometric red-blue set cover for unit squares and related problems
Multi-robot motion planning for unit discs with revolving areas
Computing the bounded subcomplex of an unbounded polyhedron
CGTA-Awards 2011
Growth rates of the number of empty triangles and simplices
Computing the face lattice of a polytope from its vertex-facet incidences
The greedy triangulation can be computed from the Delaunay triangulation in linear time
Revisiting the Fréchet distance between piecewise smooth curves
Improved upper bounds on the reflexivity of point sets
On the complexity of barrier resilience for fat regions and bounded ply
The flow complex: A data structure for geometric modeling
Geometric permutations of disjoint unit spheres
An Experimental Comparison of Four Graph Drawing Algorithms
Covering a bichromatic point set with two disjoint monochromatic disks
Queries with segments in Voronoi diagrams
Establishing strong connectivity using optimal radius half-disk antennas
Flipping in spirals
Three-clustering of Points in the Plane
Computing Grasp Functions
Non-interactive geometric probing: Reconstructing non-convex polygons
Mixed volume techniques for embeddings of Laman graphs
Approximating the integral Fréchet distance
Convex tours of bounded curvature
Edges and switches, tunnels and bridges
Maximum overlap and minimum convex hull of two convex polyhedra under translations
Labeling nonograms: Boundary labeling for curve arrangements
On a conjecture of Karasev
On the coarseness of bicolored point sets
Partial matchings induced by morphisms between persistence modules
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
On growing connected β-skeletons
Computing fence designs for orienting parts
Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation
A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms
Affine invariants of generalized polygons and matching under affine transformations
Flipping edge-labelled triangulations
Wall thickness control in layered manufacturing for surfaces with closed slices
Bounds for cops and robber pursuit
There are only two nonobtuse binary triangulations of the unit n-cube
The gamma-neighborhood Graph
Convex transversals
Hierarchical categories in colored searching
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
The cost of bounded curvature
On the stabbing number of a random Delaunay triangulation
The equipartition of curves
Computing the dilation of edge-augmented graphs in metric spaces
Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets
On k-gons and k-holes in point sets
Classification of direct kinematics to planar generalized Stewart platforms
The Common Exterior of Convex Polygons in the Plane
Converting triangulations to quadrangulations
Space-efficient geometric divide-and-conquer algorithms
Design and analysis of planar shape deformation
A note on the k-colored crossing ratio of dense geometric graphs
Exact, efficient, and complete arrangement computation for cubic curves
Encompassing colored planar straight line graphs
On the finite set of missing geometric configurations ( n 4 )
The Farthest Point Delaunay Triangulation Minimizes Angles
On circumscribing polygons for line segments
Characterization of unlabeled level planar trees
On a class of O(n 2 ) problems in computational geometry
Reprint of: Face-guarding polyhedra
Centerpoints and Tverberg's technique
Approximation algorithms for the unit disk cover problem in 2D and 3D
On the number of unit-area triangles spanned by convex grids in the plane
Many order types on integer grids of polynomial size
An intersection-sensitive algorithm for snap rounding
A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs
Reconstructing curves with sharp corners
VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
Advancing front circle packing to approximate conformal strips
Three problems about simple polygons
Densest lattice packings of 3-polytopes
On dominating set of some subclasses of string graphs
Optimal Tetrahedralization of the 3D-region "between" a Convex Polyhedron and a Convex Polygon
Relay placement for fault tolerance in wireless networks in higher dimensions
LOOK: A Lazy Object-Oriented Kernel design for geometric computation
On the chromatic number of some geometric type Kneser graphs
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
Plane hop spanners for unit disk graphs: Simpler and better
Online searching with an autonomous robot
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
Detecting and Decomposing Self-overlapping Curves
A 4-approximation of the 2π3-MST
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
A multi-dimensional approach to force-directed layouts of large graphs
Shortest rectilinear path queries to rectangles in a rectangular domain
Guest editorʼs foreword
Improved visibility representation of plane graphs
Drawing graphs with vertices and edges in convex position
Partitions of complete geometric graphs into plane trees
Finding a Shortest Diagonal of a Simple Polygon in Linear Time
Algorithms for Drawing Graphs: an Annotated Bibliography
Functional specification and prototyping with oriented combinatorial maps
The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra
Upward straight-line embeddings of directed graphs into point sets
Smoothed analysis of probabilistic roadmaps
On the orthogonal Grünbaum partition problem in dimension three
On Romeo and Juliet problems: Minimizing distance-to-sight
Translational packing of arbitrary polytopes
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension
An exact algorithm for the Euclidean k-Steiner tree problem
Upward planar drawings on the standing and the rolling cylinders
Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker
Straight-line drawings of outerplanar graphs in O(dn log n) area
Matching edges and faces in polygonal partitions
A Fourier-theoretic approach for inferring symmetries
Disconnectivity and relative positions in simultaneous embeddings
Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame
Guarding scenes against invasive hypercubes
Shape space from deformation
A general rule for disk and hemisphere partition into equal-area cells
Memoryless routing in convex subdivisions: Random walks are optimal
The Shortest Distance Among Points in General Position
Symmetric assembly puzzles are hard, beyond a few pieces
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere
Testing congruence and symmetry for general 3-dimensional objects
Geometric dominating-set and set-cover via local-search
Accelerating iterated persistent homology computations with warm starts
Locally correct Fréchet matchings
Reprint of: Refold rigidity of convex polyhedra
1-bend upward planar slope number of SP-digraphs
On the rectilinear crossing number of complete balanced multipartite graphs and balanced layered graphs
A hierarchical method for real-time distance computation among moving convex bodies
On packing squares into a rectangle
Distance-sensitive planar point location
Variable resolution triangulations
Recognizing polygonal parts from width measurements
Computing Half-plane and Strip Discrepancy of Planar Point Sets
Treemaps with bounded aspect ratio
Approximate range searching
Piercing pairwise intersecting geodesic disks
Minimizing the sum of distances to a server in a constraint network
Fast and compact planar embeddings
Regular and non-regular point sets: Properties and reconstruction
Building bridges between convex region
I/O-efficient algorithms for computing planar geometric spanners
Routing by matching on convex pieces of grid graphs
Selected papers from the 12th Annual Canadian Conference on Computational Geometry - Editorial
Piercing unit geodesic disks
On the geometric priority set cover problem
3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects
Closest-pair queries and minimum-weight queries are equivalent for squares
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
Triangulating and guarding realistic polygons
Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
A lower bound on opaque sets
Computational geometric aspects of rhythm, melody, and voice-leading
Computing Depth Orders for Fat Objects and Related Problems
On Vertical Ray Shooting in Arrangements
The point in polygon problem for arbitrary polygons
Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
Edge-unfolding nested prismatoids
m-Watchmen's routes in minbar and generalized minbar polygons
A case study in formalizing projective geometry in Coq: Desargues theorem
Minimum vertex cover in rectangle graphs
On the development of the intersection of a plane with a polytope
Equivariant Mappings: a New Approach in Stochastic Simulations
The medial axis of the union of inner Voronoi balls in the plane
Entropy-bounded representation of point grids
Two disjoint 5-holes in point sets
Infinite circle packings on surfaces with conical singularities
Approximation algorithms for Max Morse Matching
A 2D advancing-front Delaunay mesh refinement algorithm
Two theorems on point-flat incidences
New formulas for cup- i products and fast computation of Steenrod squares
Drawing the almost convex set in an integer grid of minimum size
Intersection of Unit-balls and Diameter of a Point Set in 3
A note on interference in random networks
Computing D-convex hulls in the plane
Geometric permutations of non-overlapping unit balls revisited
Extending upward planar graph drawings
Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment
Reconstructing orthogonal polyhedra from putative vertex sets
Curve-constrained drawings of planar graphs
Curve reconstruction: Connecting dots with good reason
Orienting polyhedral parts by pushing
Localized geometric query problems
Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time
Optimal randomized incremental construction for guaranteed logarithmic planar point location
Maximum number of points in general position in a random subset of finite 3-dimensional spaces
Shortest monotone descent path problem in polyhedral terrain
Minimum-area enclosing triangle with a fixed angle
The Exact Fitting Problem in Higher Dimensions
Non-crossing matchings of points with geometric objects
Rotational polygon containment and minimum enclosure using only robust 2D constructions
A general approach to the analysis of controlled perturbation algorithms
I/O-efficient dynamic planar point location
Edge routing with ordered bundles
CGTA Awards
Value-offset bifiltrations for digital images
Cost prediction for ray shooting in octrees
Reconstruction of the path graph
Point Location Among Hyperplanes and Unidirectional Ray-shooting
Dynamic conflict-free colorings in the plane
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
Draining a polygon - or - rolling a ball out of a polygon
Geometric conditions for Euclidean Steiner trees in ℜ d
Bounding the locus of the center of mass for a part with shape variation
Lower bounds for the number of small convex k-holes
Computing the Smallest K-enclosing Circle and Related Problems
Compressing spatio-temporal trajectories
Approximating Gromov-Hausdorff distance in Euclidean space
Developing a tetramonohedron with minimum cut length
Finding the Largest Area Axis-parallel Rectangle in a Polygon
Minimal enclosing parallelepiped in 3D
On some geometric optimization problems in layered manufacturing
Witness Gabriel graphs
Convex developments of a regular tetrahedron
Covering point sets with two disjoint disks or squares
On the Number of Simplicial Complexes in D
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications
Edge-unfolding nested polyhedral bands
A note on the perimeter of fat objects
Generating Random Polygons with Given Vertices
Largest triangles in a polygon
Extending range queries and nearest neighbors
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions
Efficient on-line algorithms for Euler diagram region computation
Reprint of: Grid representations and the chromatic number
A circle packing algorithm
On the edge crossing properties of Euclidean minimum weight Laman graphs
Improved approximation bounds for the minimum constraint removal problem
Self-customized BSP trees for collision detection
Shortest paths in intersection graphs of unit disks
Point Location in Zones of K-flats in Arrangements
Faster core-set constructions and data-stream algorithms in fixed dimensions
Illumination complexes, Δ-zonotopes, and the polyhedral curtain theorem
Amortized analysis of smooth quadtrees in all dimensions
Corrigendum to "Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points" [Comput. Geom. 60 (2017) 2-7]
Flips in odd matchings
Realizability of free spaces of curves
Cut locus realizations on convex polyhedra
On line-separable weighted unit-disk coverage and related problems
The visibility graph of congruent discs is Hamiltonian
Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions
Editorial - Multi-Resolution Modeling and 3D Geometry Compression
C-planarity of embedded cyclic c-graphs
Optimal higher order Delaunay triangulations of polygons
Connectivity guarantees for wireless networks with directional antennas
A linear time algorithm to remove winding of a simple polygon
Folding polyominoes with holes into a cube
Empty region graphs
The visible perimeter of an arrangement of disks
Stabbers of line segments in the plane
Packing plane spanning trees into a point set
Unfolding 3-separated polycube graphs of arbitrary genus
Lions and contamination: Monotone clearings
Point-set embeddings of trees with given partial drawings
Finding the Theta-guarded region
Local overlaps in special unfoldings of convex polyhedra
Algorithms for area-efficient orthogonal drawings
Triangulations in CGAL
The non-pure version of the simplex and the boundary of the simplex
Skeleton-based three-dimensional geometric morphing
Orthogeodesic point-set embedding of trees
Output sensitive algorithms for approximate incidences and their applications
Hunting Voronoi Vertices
Counterexamples to the uniformity conjecture
Tiling Figures of the Plane with Two Bars
Persistent homology in ℓ ∞ metric
Minimum Planar Sets with Maximum Equidistance Counts
An Optimal Parallel Algorithm Using Exclusive Read/writes for the Rectilinear Voronoi Diagram
On inducing polygons and related problems
Bounds on soft rectangle packing ratios