yusuke1997/dblp-id-title huggingface dataset:
Efficient Bitmap Resemblance Under Translations
A Visibility-Based Pursuit-Evasion Problem
Fast Software for Box Intersections
On Multi-level K-ranges for Range Search
Searching a Polygonal Room with One Door by a 1-Searcher
Optimal Algorithms to Detect Null-Homologous Cycles on 2-Manifolds
An Algorithm for Drawing a Hierarchical Graph
On the normal parametrization of curves and surfaces
Virtual Geoexploration: Concepts and Design Choices
Ruled Surfaces of Revolution with Moving Axes and Angles
Computing shortest transversals of sets
Mapping Complicated Surfaces onto a Sphere
Parallel computation of internal and external farthest neighbours in simple polygons
An optimal construction method for generalized convex layers
Fitting a Step Function to a Point Set with Outliers Based on Simplicial thickness Data Structures
Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining
Maintenance of Geometric Representations through Space Decompositions
Classification of a point with respect to a polyhedron vertex
Computing the union of 3-colored triangles
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
3-Colorability of Pseudo-Triangulations
Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
Efficient Non-Intersection Queries on Aggregated Geometric Data
Precise Voronoi Cell Extraction of Free-Form Planar Piecewise C 1 -Continuous Closed Rational Curves
Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance
Diamonds are Not a Minimum Weight Triangulation's Best Friend
The (1|1)-Centroid Problem in the Plane with Distance Constraints
Collision Detection Optimization in a Multi-Particle System
Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes"
Flooding Countries and Destroying dams
Walking on an arrangement topologically
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks
A Complete Algorithm for Searchlight Scheduling
Evaluation of Range Searching Methods for Contact Searching in Mechanical Engineering
Abstract Voronoi Diagrams with Disconnected regions
Numerical stability of algorithms for 2-d Delaunay triangulations
Computational geometry column 15
On Rectangular Covering Problems
Weighted Voronoi Diagrams in the Maximum Norm
Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests
k-Centerpoints Conjectures for Pointsets in ℝd
Implicit Methods for Geometry Creation
Minimum Number of Pieces in a Convex Partition of a Polygonal Domain
Parallel algorithms for computing the closest visible vertex pair between two polygons
A Fast k-Means Implementation Using Coresets
Furthest Site Abstract Voronoi Diagrams
Generalized Melzak's Construction in the Steiner Tree Problem
Continuous Path Verification in Multi-axis Nc-machining
Possibilities and Impossibilities in Square-Tiling
The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location
Some Results on Semi-Symmetric Spaces
Deceiving the V-Block Method for Assessment of Departure from Roundness
Shortest Non-Crossing Rectilinear Paths in Plane Regions
Sparse Arrangements and the Number of Views of Polyhedral Scenes
A Unistable Polyhedron with 14 Faces
Interval-based Tracing of Strange Attractors
Approximating Smallest Enclosing Balls with Applications to Machine Learning
Delaunay and diamond Triangulations contain Spanners of Bounded Degree
Non-Rational and Rational Transfinite Interpolation Using Bernstein Polynomials
Improved Grid Map Layout by Point Set Matching
Immobilizing a Shape
Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
Solution-Based Mesh Quality Indicators for Triangular and Tetrahedral Meshes
Efficient Approximation Algorithms for Two-Label Point Labeling
Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets
Shortest Paths of Mutually Visible Robots
Initial Parametric Representation of Blobs
Cutting out Polygons with Lines and Rays
Algorithms for Necklace Maps
A note from the editors-in-chief
A Lower Bound for Lebesgue's Universal Cover Problem
External Memory orthogonal Range Reporting with Fast Updates
Approximating center points with iterative Radon points
Finding All Door Locations that Make a Room Searchable
Overlaying surface meshes, part I: algorithms
Inflating Balls is NP-Hard
The Shuffling Buffer
Computing k Centers over Streaming Data for Small k
Probabilistic Analysis for Discrete Attributes of Moving Points
A General Approximation Algorithm for Planar Maps with Applications
Exchangeability and Non-Conjugacy of Braid Representatives
Algorithms and a Library for the Exact Computation of the Cumulative Distribution Function of the Euclidean Distance Between a Point and a Random Variable Uniformly Distributed in Disks, Balls, or Polygones and Application to Probabilistic Seismic Hazard Analysis
Voronoi Diagrams of Moving Points
Convex Quadrangulations of Bichromatic Point Sets
Brep-index: a multidimensional space partitioning tree
Euler Transformation of Polyhedral Complexes
On reconstructing polyhedra from parallel slices
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
When and why delaunay refinement algorithms work
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling
Bézier Subdivision for Inverse Molecular Kinematics
Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem
Ruler Wrapping
Cylindrical hierarchy for deforming necklaces
Partial Enclosure Range Searching
Computational Geometry Column 48
Computing a double-ray center for a planar point set
Far-Field Reflector Problem Under Design Constraints
Complexity Measures for Assembly Sequences
Guarding Orthogonal Art Galleries with Sliding Cameras
Computing the all-pairs longest chains in the plane
Geometrical Constraint System Decomposition: a Multi-group Approach
Min-/Max-Volume Roofs Induced by Bisector Graphs of Polygonal Footprints of Buildings
Evaluation of Non-uniform Doo-sabin Surfaces
Selection Lemmas for Various Geometric Objects
Nonsmooth Analysis, Convex Analysis, and their Applications to Motion Planning
A convex hull algorithm for points with approximately known positions
Multi-Directional Width-Bounded Geometric Separator and protein Folding
Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error
A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
Finding the largest Empty Disk containing a Query Point
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks
Sampling in Dynamic Data Streams and Applications
Polygon Area Decomposition for Multiple-Robot Workspace Division
A Lower Bound on the Area of a 3-Coloured Disk Packing
Parallelizing and Algorithm for Visibility on Polyhedral Terrain
Traveling salesman problem of segments
Geosheet: A Distributed Visualization Tool for Geometric Algorithms
Culling a Set of Points for Roundness or Cylindricity Evaluations
An on-line algorithm for navigating in unknown environment
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons
Faraway Point: a Sentinel Point for Delaunay Computation
On maintaining the width and diameter of a planar point-set online
Geometric Streaming Algorithm with a Sorting Primitive
Optimal Reparametrization of Polynomial Algebraic Curves
Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints
Designing multi-link robot arms in a convex polygon
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
Compressive Sensing with Local Geometric Features
Minimal Curvature-Constrained Paths in the Plane with a Constraint on arcs with Opposite orientations
Packing a Truck - Now with a Twist!
Reconciling Conflicting Combinatorial Preprocessors for Geometric Constraint Systems
Randomized parallel algorithms for trapezoidal diagrams
Testing Mutual duality of Planar graphs
The Tsp and the Sum of its Marginal Values
Maximal empty ellipsoids
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane
Triangulating disjoint Jordan chains
Local Robustness and its Application to Polyhedral Intersection
Data Generation for Geometric Algorithms on Non-Uniform Distributions
A Geometric Spanner of Segments
Maximum independent set of a permutation graph in K tracks
Faster Circle Packing with Application to Non-Obtuse Triangulation
Geometric Algorithms for Density-based Data Clustering
Using Invariants To Extract Geometric Characteristics Of Conic Sections From Rational Quadratic Parameterizations
A Complete Implementation for Computing General Dimensional Convex Hulls
An Efficient Algorithm for the 2-Central Path Problem
A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas
Reverse Nearest Neighbor Queries in Fixed Dimension
SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition
Boat-Sail Voronoi Diagram and its Application
Bounded-Velocity Approximation of Mobile Euclidean 2-Centres
N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds
Weight-Equitable Subdivision of Red and Blue Points in the Plane
Folding Equilateral Plane graphs
Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs
The ray casting engine and ray representations: a technical summary
Metric Spaces with Expensive Distances
Dissections of Polygons into Convex Polygons
Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces
Constructing Points through Folding and Intersection
Computational Geometry Column 41
Two-dimensional range search based on the voronoi diagram
Nearest neighbor problems
Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus
Translation queries for sets of polygons
Correctness proof of a geometric constraint solver
Computing an Almost Minimum Set of Spanning Line Segments of a Polyhedron
Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time
Floating-Point Arithmetic for Computational Geometry Problems with Uncertain Data
Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction
Efficient Algorithms for Optimization-Based Image Segmentation
Separability of Point Sets by k-Level Linear Classification Trees
Shortest Path amidst Disc Obstacles Is Computable
Edge Advancing Rules for Intersecting Spherical Convex Polygons
Simplipoly: Curvature-Based Polygonal Curve Simplification
Energy-Aware Stage Illumination
On Connecting Red and Blue Rectilinear Polygonal Obstacles with Nonintersecting Monotone Rectilinear Paths
Tree-weighted neighbors and geometric k smallest spanning trees
A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors
Voronoi Diagram of a Polygon in chessboard Metric and Maskless lithographic Applications
Searching Polyhedra by rotating half-Planes
Computational Geometry Column 42
Finding Simplices containing the Origin in Two and Three Dimensions
An Algorithm for Searching a Polygonal Region with a Flashlight
Topological Peeling and Applications
A Refined Definition for Groups of Moving Entities and Its Computation
Line-of-Sight Pursuit in Monotone and Scallop Polygons
Path Planning in Expansive Configuration Spaces
Erratum: Polynomial-size nonobtuse triangulation of polygons
Efficient approximation algorithms for pairwise data clustering and applications
A Fast Straight-Skeleton Algorithm Based on generalized Motorcycle Graphs
Virtual Topology Operators for Meshing
Shortest rectilinear paths among weighted obstacles
Geometric Optimization Problems over Sliding Windows
On the Time Bound for Convex Decomposition of Simple Polygons
Quadrilateral Meshing by Circle Packing
Stabbing Simplices of Point Sets with k -flats
Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon
Decision trees for geometric models
Properties of Arrangement Graphs
Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes
Computing Geometric Minimum-Dilation Graphs is NP-Hard
Separating Point Sets in Polygonal Environments
BOOLE: A Boundary Evaluation System for Boolean Combinations of Sculptured Solids
Constructing the City Voronoi Diagram Faster
Minimum Dominating Set Problem for Unit Disks Revisited
Scalable parallel computational geometry for coarse grained multicomputers
Polyhedra with Unguarded Interiors
Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems
Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes
On the difficulty of deciding the convexity of polynomials over simplexes
Simultaneous Embedding of Outerplanar Graphs, Paths, and Cycles
Algorithms for Tolerant Tverberg Partitions
Successive Mappings: An Approach to Polygonal Mesh Simplification with Guaranteed Error Bounds
Computational geometry column 25
Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors
Unique Coverage with Rectangular Regions
The Point-Set Embeddability Problem for Plane graphs
Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion
Reducing the Time Complexity and Identifying Ill-posed Problem Instances of Minkowski Sum Based Similarity calculations
Reconstructing Point Set Order Types from Radial Orderings
Computational Geometry Column 45
Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons
An approximate morphing between polylines
Pareto Envelopes in Simple Polygons
An Improved Hypercube Bound for Multisearching and Its Applications
Laguerre-Intersection Method for Implicit Solvation
An Approximate Arrangement Algorithm for Semi-Algebraic Curves
Approximate Bregman Near Neighbors in Sublinear Time: beyond the Triangle inequality
On the boundedness of an Iteration involving Points on the Hypersphere
Every outer-1-Plane Graph has a Right Angle Crossing Drawing
Cartesian Product Of Simplicial And Cellular Structures
Reaching a Polygon with Directional Uncertainty
Rational Quadratic Parameterizations of Quadrics
Efficient Exact Enumeration of Single-Source Geodesics on a Non-Convex Polyhedron
Vertex Guarding for Dynamic Orthogonal Art Galleries
The Persistent Homology of Cyclic Graphs
A Convex Deficiency Tree Algorithm for Curved Polygons
Path Tracking Using Echoes in an Unknown Environment: The Issue of Symmetries and How to Break Them
Finite representations of real parametric curves and surfaces
Computational geometry column 24
Gpdof - a Fast Algorithm to Decompose under-constrained Geometric Constraint Systems: Application to 3d Modeling
Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input
The visibility complex
Nurbs Approximation of A-Splines and A-Patches
Manhattonian proximity in a simple polygon
Red-blue separability problems in 3D
Voronoi diagrams in a river
Polygon Decomposition and the Orthogonal Art Gallery Problem
Isomorphic Triangulations with Small Number of Steiner Points
Separating Points by Axis-parallel Lines
Efficient algorithms for solving diagonal visibility problems in a simple polygon
Labeling Points with Circles
P-complete geometric problems
Compact interval trees: a data structure for convex hulls
Determining a Set of Maximum Inscribed Rectangles for Label Placement in a Region
Overlaying surface meshes, part II: topology preservation and feature matching
Dynamic Algorithms for Visibility Polygons in Simple Polygons
Distance visibility graphs
Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions
Estimating Multidimensional Persistent Homology Through a Finite Sampling
Computing Minkowski sums of plane curves
New sparseness results on graph spanners
An Optimal Morphing Between Polylines
Boundary-optimal Triangulation Flooding
Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
A parallel algorithm for enclosed and enclosing triangles
Frameworks Symmetry and Rigidity
Approximating 3D Points With Cylindrical Segments
Computing Closest Points for Segments
An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane
Anisotropic Triangulation of Parametric Surfaces via Close Packing of Ellipsoids
Point Visibility Graphs and O-Convex Cover
Algorithms for Euclidean Degree Bounded Spanning Tree Problems
Illumination of Orthogonal Polygons with Orthogonal Floodlights
Constraint on simple geometry in two and three dimensions
Geometry of bisectors for strictly convex distances
Computing the Fréchet distance between two polygonal curves
Ball-Map: Homeomorphism between Compatible Surfaces
3-Piercing of d-Dimensional Boxes and Homothetic Triangles
Subpixel image registration using circular fiducials
Medial Axis Approximation and Unstable Flow Complex
Approximation Algorithm for Multiple-Tool Milling
Computational geometry column 12
Maximal balls of linearly separable sets
Free-Form Surface Partition in 3-d
Evaluating geometric sensitivities at singular and non-singular points of variational CAD models for design optimization
Existence and Computation of Tours through Imprecise Points
Computing Signed Permutations of Polygons
Fast Reconstruction of Curves with Sharp Corners
The Aligned k-Center Problem
Computational geometry column 13
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries
The L infty -Voronoi Diagram of Segments and VLSI Applications
Computational Geometry Column 38
Good news: Partitioning a simple polygon by compass directions
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
Multidimensional Online Motion Planning for a Spherical Robot
A Bottleneck Matching Problem with Edge-Crossing Constraints
Enumerating interdistances in space
A Fast Implementation of the Isodata Clustering Algorithm
Robust nonparametric Simplification of Polygonal Chains
Some Lower Bounds on Geometric Separability Problems
Efficient Approximation of Convex Polygons
1-Extensions and Global Rigidity of Generic Direction-Length Frameworks
Region coloring, edge coloring, and scan-conversion of maps
Continuous Surveillance of Points by rotating Floodlights
A Cost/Benefit Analysis of Simplicial Mesh Improvement Techniques as Measured by Solution Efficiency
A predictive algorithm for intersecting parametric polynomial surfaces
Fitting Flats to Points with Outliers
Computational geometry column 22
Provable Dimension Detection Using Principal Component Analysis
On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs
A Point-Placement Strategy for Conforming Delaunay Tetrahedralization
A survey of object-space hidden surface removal
Guarding a Polygon from Two Nearly-Opposite Directions
Image Segmentation with Asteroidality/Tubularity and Smoothness Constraints
Planar Curve Routing for Tethered-Robot Motion Planning
A Static Optimality Transformation with Applications to Planar Point Location
Finding the Convex Hull of Discs in Parallel
Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path
Skew Voronoi Diagrams
Delaunay stability via perturbations
The expected extremes in a Delaunay triangulation
Fast Fréchet Distance Between Curves with Long Edges
Mitered Offsets and Skeletons for Circular Arc Polygons
On Hamiltonian Triangulations in Simple Polygons
Spread: A Measure of the Size of Metric Spaces
Searching a Room by Two Guards
Embedding the double Circle in a Square Grid of Minimum Size
Normal-Map between Normal-Compatible Manifolds
Unstructured Mesh Generation: Theory, Practice, and Perspectives
Labeling Points on a Single Line
Point Set Labeling with Specified Positions
Constraining a quadratic rational Bezier to be an elliptical arc
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω
Exact and Optimal Convex Hulls in 2D
Mixed Spanning Trees in Theory and Practice
On the Curvature Functions of Ruled Surface
Tiling the Plane with a Set of Ten Polyominoes
Two-Guard Walkability of Simple Polygons
An O(n log n) Algorithm for Finding a Shortest Central Link Segment
Efficient Algorithm for Optimal Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy
Guest Editor's Foreword - Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, Minnesota, June 1998
Pricing Geometric Transportation Networks
Cutting out Polygons with a Circular SAW
Triangulating polygons without large angles
Topology-Guided Tessellation of Quadratic Elements
Parallel solid Modeling Using BSP Dataflow
Extending the Doubly Linked Face List for the Representation of 2-pseudomanifolds and 2-Manifolds with Boundaries
Computational geometry column 20
Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods
Free-Form Modeling in Bilateral Brep and CSG Representation Schemes
Erratum - Eliminating extraneous solutions in curve and surface operations
On the Expected Size of the 2D Visibility Complex
Separating sets of hyperrectangles
Octree-Based Hexahedral Mesh Generation
A Bound on a Convexity Measure for Point Sets
Aggregate-MAX Top- k Nearest Neighbor Searching in the L 1 Plane
Sliver Removal by Lattice Refinement
Locating an obnoxious Line among Planar Objects
Motion planning of legged robots: the spider robot problem
Computational Geometry Column 32
Tetris is hard, even to approximate
Computational Geometry Column 44
An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems
Two Algorithms for the Sum of Diameters Problem and a Related Problem
Towards Web-Based Computing
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem
Computational Geometry Column 31
Greedy Construction of 2-Approximate Minimum Manhattan Networks
How to Draw a Series-Parallel Digraph
Parallel algorithms for some dominance problems based on the PRAM model
Fpt-Algorithms for Minimum-Bends Tours
Sequential and parallel algorithms for the k closest pairs problem
Maximizing a Voronoi Region: the Convex Case
Stoker's Theorem for Orthogonal Polyhedra
Optimal BSPs and Rectilinear Cartograms
Improved Computation of Optimal Rectilinear Steiner Minimal Trees
Improved Maximum Angle Estimate for Longest-Edge Bisection
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
On Edge-Length Ratios of Partial 2-Trees
Homotopy-Preserving Medial Axis Simplification
Computing the Center of Area of a Convex Polygon
π/2-Angle Yao Graphs are Spanners
High Fidelity Interval Assignment
Relations between Two Common Types of Rectangular Tilings
Triangulation of Branching Contours Using Area Minimization
Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes
ESG Rating Prediction and Management Integrating LightGBM Feature Filtering Algorithm
Circular visibility of a simple polygon from a fixed point
Finding an Optimal Bridge Between Two Polygons
Computational geometry column 14
Almost Optimal Solutions to k-Clustering Problems
High Quality Quadrilateral Surface Meshing Without Template Restrictions: A New Approach Based on Network Flow Techniques
Orthogonal shortest route queries among axis parallel rectangular obstacles
An Extended MMP Algorithm: Wavefront and Cut-Locus on a Convex Polyhedron
Truchet Tiles and Combinatorial Arabesque
Dynamization of the trapezoid method for planar point location in monotone subdivisions
Counting d-Dimensional Polycubes and nonrectangular Planar polyominoes
Two Tree Drawing Conventions
Minimum Cell Connection in Line Segment Arrangements
On computing Voronoi diagrams for sorted point sets
Chief Editor's Notice
Errata: Maintenance of Geometric Representations Through Space Decompositions
Planar Strong Visibility
Convex Grid Drawings of 3-Connected Planar Graphs
Computational Geometry Column 35
Clearing a Polygon with Two 1-Searchers
Finding Planar Regions in a Terrain - in Practice and with a Guarantee
An efficient divide and conquer approximation algorithm for partitionning into D-boxes
A Hybrid Approach for Determinant Signs of Moderate-Sized Matrices
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching