yusuke1997/dblp-id-title huggingface dataset:
A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane
Visibility maintenance of a moving segment observer inside polygons with holes
Range Assignment of Base-Stations Maximizing Coverage Area without Interference
Linear approximation of simple objects
On the topology of the level sets of a scalar field
Chasing Puppies
Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries
Interference Minimization in k-Connected Wireless Networks
Approximate euclidean ramsey theorems
Approximating smallest enclosing disks
A computational approach to stability problems
The Length of the Beacon Attraction Trajectory
Fun with Restricted Delaunay Triangulations
On the Minimal Number of Volume Intersection Operations Necessary for Reconstructing a 3D Object
Counting Convex k-gons in an Arrangement of Line Segments
Squarability of rectangle arrangements
Graph Drawing via Layered Partitions
Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice
Coloring geometric hypergraph defined by an arrangement of half-planes
The exact cost of exploring streets with a cab
Illuminating convex polygonswith vertex floodlight
Tries for combined text and spatial data range search
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
Experiments on Area Compaction Algorithms for Orthogonal Drawings
Map Folding
Approximating the Obstacle Number for a Graph Drawing Efficiently
Dynamic maintenance and visualization of molecular surfaces
Correcting Topological Defects of Tessellations
Unfolding Manhattan Towers
Towards a Definition of Higher Order Constrained Delaunay Triangulations
Continuous Yao Graphs
Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies
On flat-state connectivity of chains with fixed acute angles
Parallel searching on a lattice
Adaptive Searching in One and Two Dimensions
A Seed Placement Strategy for Conforming Voronoi Meshing
Perfect Binary Space Partitions
Hyperbanana Graphs
Partitioning orthogonal polygons into fat rectangles
Triangulating with High Connectivity
Using bistellar flips for rotations in point location structures
Detection of text-line orientation
An Efficient Query Structure for Mesh Refinement
Geometric Partitioning
On t-fold Totally-Concave Polyominoes
Computing Depth Contours with Graphics Hardware
Polar Diagram of Moving Objects
Turing computability of (non-)linear optimization
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
Session O1: Open Problems and Planning
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
Minimum Anchored Steiner Trees with Removable Obstacles
Universal convex covering problems under affine dihedral group actions
Efficient Snap Rounding with Integer Arithmetic
Efficient Folding Algorithms for Regular Polyhedra
Beacon Coverage in Orthogonal Polyhedra
Semi-dynamic Closest-pair Algorithms
How To Place a Point to Maximize Angles
Fast local searches and updates in bounded universes
Computing the Closest Point to a Circle
3d local algorithm for dominating sets of unit disk graphs
A framework for memory-efficient levels of detail
The Edge Guard Problem for Spiral Polygons
Binary space partitioning tree and constructive solid geometry representations for objects bounded by curved surfaces
Generating Rooted Triangulations with Minimum Degree Four
The Centervertex Theorem for Wedge Depth
Orthogonal Polygon Reconstruction
Fast delaunay point location with search structures
Testing roundness of a polytope and related problems
Plane packing
k-sets and continuous motion in R 3
Uniformly Monotone Partitioning of Polygons Revisited
Orthogonal Drawings with the Minimum Number of Bends
On Rolling Cube Puzzles
On covering of any point configuration by disjoint unit disks
The complexity of flow diagrams in the plane
Computing Delaunay Triangulation with Imprecise Input Data
Nurimisaki and Sashigane are NP-complete
Finding a Maximum Clique in a Grounded 1-Bend String Graph
Opportunities for mathematicians in industry government research
Aggregate-Max Nearest Neighbor Searching in the Plane
The 3d visibility complex: a unified data-structure for global visibility of scenes of polygons and smooth objects
Invited talk: Cannons at Sparrows
A balanced partition of points in the plane and tree embedding problems
The Slider-Pinning Problem
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains
The Complexity of Guarding Monotone Polygons
Deflating polygons to the limit
Burning Number for the Points in the Plane
On Restricted Boundary Covers and Convex Three-Covers
Easy triangle strips for tin terrain models
Encoding Quadrilateral Meshes
Hierarchical planar voronoi diagram approximations
The Region Approach for some Dynamic Closest-Point Problems
A Streaming Algorithm for 2-Center with Outliers in High Dimensions
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem
The Possible Hull of Imprecise Points
Level Difference of the Reconstructed Arrangement
Compatible pointed pseudo-triangulations
Partial Matching of Planar Polygons Under Translation and Rotation
The point set order type data base: A collection of applications and results
Slope Preserving Terrain Simplification - An Experimental Study
Reducing Nearest Neighbor Training Sets Optimally and Exactly
Complexity of Octagonal and Rectangular Cartograms
The box mover problem
Maximal Covering by Two Isothetic Unit Squares
Optimal Schedules for 2-guard Room Search
Experimental lower bounds for three simplex chirality measures in low dimension
Finding Maximum Density Axes Parallel Regions for Weighted Point Sets
On the number of triangulations every planar point set must have
Square Hardness for Clustering with Neighborhoods
Counting Triangulations Approximately
Disk Constrained 1-Center Queries
When Can We Treat Trajectories as Points?
Staying Close to a Curve
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis
Optimal convex partitions of point sets with few inner points
Planar Emulators for Monge Matrices
Terminal Steiner Tree with Bounded Edge Length
A note on alpha-drawable k-trees
Realizing Site Permutations
Adaptive Metrics for Adaptive Samples
Clarkson's Algorithm for Violator Spaces
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets
A General Algorithm for the Maximum Span of Fixed-Angle Chains
Computing Fréchet Distance with Speed Limits
On the Rectangle Escape Problem
Optimal Floodlight Illumination of Orthogonal Art Galleries
Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing
Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, SK, Canada, August 1994
Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together)
The Complexity of Rivers in Triangulated Terrains
Maximum-Weight Planar Boxes in O(n 2 ) Time (and Better)
Sparse Convex Hull Coverage
Separating points by axis-parallel lines
Generalized Ham-Sandwich Cuts for Well Separated Point Sets
Minimum-sum Dipolar Spanning Tree for Points in R 3
Bounded-Curvature Path Normalization
Collection depot location problem in the plane
On Piercing (Pseudo)Lines and Boxes
Shooter Location Problem
The traveling salesman problem for lines and rays in the plane
On the FPT Status of Monotone Convex Chain Cover
Optimal approximation of monotone curves on a grid
PushPush and Push-1 are NP-hard in 2D
An Experimental Assessment of the 2D Visibility Complex
Approximating Majority Depth
On the Precision to Sort Line-Quadric Intersections
How to make a picturesque maze
An upper bound of 84 for Morpion Solitaire 5D
The VC-Dimension of Limited Visibility on the Boundary of a Simple Polygon
Set-Difference Range Queries
An In-Place Priority Search Tree
A Theory of Spherical Diagrams
Quantum Speedup for Some Geometric 3SUM-Hard
Generalized Kernels of Polygons with Holes
Theta-3 is connected
Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013
The Planar Slope Number
A Fourier-Theoretic Approach for Inferring Symmetries
On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces
Testing extendability for partial chirotopes is np-complete
Using Existential Theory of the Reals to Bound VC Dimension
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification
Computing minimum limited-capacity matching in one-dimensional space and for the points lying on two perpendicular lines
Compass routing on geometric networks
Generalized Guarding and Partitioning for Rectilinear Polygons
Counting Carambolas
On k-Gons and k-Holes in Point Sets
Inapproximability of the Perimeter Defense Problem
On the Design and Performance of Reliable Geometric Predicates using Error-free Transformations and Exact Sign of Sum Algorithms
Optimal Algorithms to Detect Null-homologous Cycles on 2-manifolds
Decimating samples for mesh simplification
Planar sets with few empty convex polygons
The Maximum Disjoint Set of Boundary Rectangles
Near optimal-partitioning of rectangles and prisms
A Simple Algorithm for Maintaining the Center of a Planar Point-set
Redundant Persistent Acyclic Formations for Vision-Based Control of Distributed Multi-Agent Formations
Handling rotations in the placement of curved convex polygons
Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited
Invited talk: Computational Geometry in Air Traffic Management
Small weak epsilon nets
Finding Maximally Consistent Sets of Halfspaces
Quantifying Design: the geometric properties behind designer choices and human perception
On the Number of Extrema of a Polyhedron
Asymptotically efficient triangulations of the d -cube
Convex Hull Complexity of Uncertain Points
Capturing Crossings: Convex Hulls of Segment and Plane Intersections
On distinct distances among points in general position and other related problems
Sto-Stone is NP-Complete
CCOSKEG Discs in Simple Polygons
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon
Subquadratic algorithms for the weighted maximin facility location problem
A coarse grained parallel solution to terrain simplification
The Distance Geometry of Deep Rhythms and Scales
Optimal Orientation of Symmetric Directional Antennas on a Line
Common Development of Prisms, Anti-Prisms, Tetrahedra, and Wedges
The arithmetic precision of ray-polygon intersection testing
Flips in Edge-Labelled Pseudo-Triangulations
Geometric Hitting Set and Set Cover Problem with Half-Strips
An Optimal Algorithm for Greedy Triangulation of a Set of Points
A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons
Square Formation by Asynchronous Oblivious Robots
How Small Can Faithful Sets Be? Ordering Topological Descriptors
Motion Planning for Vacuum Cleaner Robots
2D Closest Pair Problem: A Closer Look
New epsilon-net constructions
Approximating 2-Clique in Unit Disk Graphs
Hamilton Circuits in Hexagonal Grid Graphs
Where and How Chew's Second Delaunay Refinement Algorithm Works
Efficiently Enumerating Scaled Copies of Point Set Patterns
Pushing blocks is np-complete for noncrossing solution paths
Computing Cut Numbers
Ladder-Lottery Realization
Constructing Optically in Constant Time the K-Level of an Arrangement of Lines in the Plane and Other Related Problems
Minimum Ply Covering of Points with Disks and Squares
Tiling Polyhedra with Tetrahedra
Time-Dependent Shortest Path Queries Among Growing Discs
Terrain Representation using Right-Triangulated Irregular Networks
Burning the Medial Axis
Fitting a Graph to One-Dimensional Data
A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets
Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
When can a net fold to a polyhedron
The Discrete Median and Center Line Segment Problems in the Plane
Draining a Polygon - or - Rolling a Ball out of a Polygon
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions
Computing Maximum Cliques in Unit Disk Graphs
Probalistic Algorithms for Efficient Grasping and Fixturing
Reverse facility location problems
Approximating Radio Maps
Proceedings of the 37th Canadian Conference on Computational Geometry (CCCG 2025), York University, Toronto, Canada, August 13-15, 2025
Geometric Algorithms for k-NN Poisoning
Quasi-Twisting Convex Polyhedra
Lower Bounds for the Number of Small Convex k-Holes
Tolerance-Free NeST Representations
Shapes of the future - some unsolved problems in high-dimensional intuitive geometry
The Inapproximability of Illuminating Polygons by α-Floodlights
Almost optimal on-line search in unknown streets
Minimizing Slope Change in Imprecise 1.5D terrains
Finding Intersections of Bichromatic Segments Defined by Points
Computing the set of all distant horizons of a terrain
Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D
Diverse Non Crossing Matchings
Reconfiguring a Chain of Cubes
Optimal Rectilinear Steiner Minimal Trees in O (n 2 2.62 n ) Time
Local optimization of triangular surface meshes for general quadrics in lp norm
On the Height of a Homotopy
Rock Climber Distance: Frogs versus Dogs
Computing the Angularity Tolerance
Flips in Odd Matchings
Partitioning the sphere with constant area quadrangles
Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, August 12-14, 2002
A simple linear algorithm for computing rectangle 3-centers
General minisum circle location
The Projection Median of a Set of Points in R 2
Efficient Algorithms for Robust Circular Arc Estimators
Scheduling Three Trains is NP-Complete
Toward the Tight Bound of the Stretch Factor of Delaunay Triangulations
Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996
An Optimal Algorithm for Maintaining Connectivity of Wireless Network on a Line
An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems
Approximating Geodesic Distances on 2-Manifolds in R3
On a dispersion problem in grid labeling
On 3-layered Cornerhedra: Optimum Box Partitions for Niches
Decomposing Polygons Into Diameter Bounded Components
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup
Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments
On the VC-Dimension of Visibility in Monotone Polygons
Optimally Confining Lattice Polymers
Computing the Tool Path of an Externally Monotone Polygon in Linear Time
Unfolding a New Class of Orthographs of Arbitrary Genus
Near-Delaunay Metrics
Path Planning in a Weighted Planar Subdivision Under the Manhattan Metric
Counting Simple Polygonizations of Planar Point Sets
A watershed algorithm for triangulated terrains
Ane invariant triangulations
Tiling 3d euclidean space with acute tetrahedra
Open Problems from CCCG 2012
Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles
Tradeoffs between Bends and Displacement in Anchored Graph Drawing
On the number of lines tangent to four convex polyhedra
Approaches to High Aspect Ratio Triangulations
Optimizing Budget Allocation in Graphs
On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the Plane
Subexponential-time algorithms for minimum weight triangulations and related problems
Maximal Length Common Non-intersecting Paths
Optimal guarding of polygons and monotone chains
PersiSort: A New Perspective on Adaptive Sorting Based on Persistence
Combinatorial Reconfiguration: Flipping Non-Crossing Spanning Trees
Proceedings of the 35th Canadian Conference on Computational Geometry, CCCG 2023, Concordia University, Montreal, Quebec, Canada, July 31 - August 4, 2023
Finding k-Closest-Pairs Efficiently for High Dimensional Data
Computational comparison of voting-based and arrangement-based schema for digital line detection
Convex Minimization on a Grid and Applications
A note on checking proximity graphs
On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation
Drawing planar bipartite graphs with small area
On Delaunay oriented Matroids
Characterizing minimum-length coordinated motions for two discs
Representing a Planar Straight-Line Graph Using Few Obstacles
Paul Erdös memorial lecture
A simple probablistic algorithm for approximating two and three-dimensional objects
Pointed Drawings of Planar Graphs
On the d-Runaway Rectangle Escape Problem
A New Approach for Boundary Recognition in Geometric Sensor Networks
Some properties of higher order delaunay and gabriel graphs
Blocking delaunay triangulations
A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods
A Lower Bound on the Area of a 3-Coloured Disc Packing
Hiding disks in folded polygons
Piercing Unit Geodesic Disks
Open Problems from CCCG 2025
Approximate Free Space Construction and Maximum Clearance Path Planning for a Four Degree of Freedom Robot
A Simple Algorithm for kNN Sampling in General Metrics
Translating a Star over a Point Set
Covering Points by Isothetic Unit Squares
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems
Relocating Units in Robot Swarms with Uniform Control Signals is PSPACE-Complete
The Focus of Attention Problem Revisited
Development of Curves on Polyhedra via Conical Existence
Obnoxious facility location: Complete service with minimal harm
Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to Proteins
Discrete Planar Map Matching
Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
Top-k colored orthogonal range search
Hitting a Set of Line Segments with One or Two Discrete Centers
On the Reachable Regions of Chains
Tighter Bounds on Voronoi Diagrams of Moving Points
Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals
Fractional Helly theorem, weak epsilon nets and geometric piercing
Dominating Set of Rectangles Intersecting a Straight Line
Tolerance of Geometric Structures
Skeletal Cut Loci on Convex Polyhedra
A Problem on Track Runners
The Continuous-graph Approach to Visibility Problems
Peeling Digital Potatoes
Partitioning orthogonal polygons into fat rectangles in polynomial time
On the Shortest Separating Cycle
Biased search and k-point clustering
Low Ply Drawings of Trees and 2-Trees
Cutting rectangles in equal area pieces
The PKD-tree for Orthogonal d-Dimensional Range Search
Modeling with Simplicial Complexes
Shape reconstruction using skeleton-based implicit surface
Proceedings of the 12th Canadian Conference on Computational Geometry, Fredericton, New Brunswick, Canada, August 16-19, 2000
Partitions of planar point sets into polygons
Some tools for modeling and analysis of surfaces
Application of computational geometry to network p-center location problems
Steiner Reducing Sets of Minimum Weight Triangulations
All Convex Polyhedra can be Clamped with Parallel Jaw Grippers
Window Queries On Planar Subdivisions Arising From Overlapping Polygons
The Bichromatic Rectangle Problem in High Dimensions
The extrinsic nature of the Hausdor distance of optimal triangulations of manifolds
Unfolding Low-Degree Orthotrees with Constant Refinement
The size of the open sphere of influence graph in metric spaces
Triangulations Loosing Bundles and Weight
Bounded-degree polyhedronization of point sets
Proceedings of the 5th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, August 1993
The Erdös-Nagy theorem and its ramifications
An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon
Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15-18, 1999
Multidimensional Orthogonal Range Search Using Tries
On the nonexistence of dimension reduction for ℓ2 2 metrics
Curves of width one and the river shore problem
Covering Points with Disjoint Unit Disks
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
Invited Lecture: Predicting the Flexibility and Rigidity of Proteins: Geometry, Combinatorics, Conjectures, and Algorithms
Optimally Tracking Labels on an Evolving Tree
Approximate Orthogonal Range Search using Patricia Tries
Efficient Algorithms for Range Queries in Protein Sequence Analysis
Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon
The Complexity of the Compaction Problem
Rectilinear 2-center problems
Quickly Placing a Point to Maximize Angles
Minimum Ply Covering of Points with Unit Disks
Minimum Ply Covering of Points with Convex Shapes
The shuffling buffer
On hardness of roundness calculation
Covering Orthogonal Polygons with Sliding k-Transmitters
Opposing Half Guards
All Approximating Segments for a Sequence of Points
Polyhedral roll-connected colorings of partial tilings
Social Distancing is Good for Points too!
Weighted Minimum Backward Frechet Distance
Polygon Reconstruction from Line Cross-Sections
Balanced k-Center Clustering When k Is A Constant
On Computing Voronoi Diagrams of Convex Polyhedra by Means of Wavefront Propagation
Open problems from cccg 2000
Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions
Line Segment Visibility: Theoretical and Experimental Results
Surface reconstruction, one triangle at a time
An Output-Sensitive Algorithm for Computing Weighted α-Complexes
Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results
Perfect divisions of a cake
Geometric shellings of 3-polytopes
Carving Polytopes with Saws in 3D
Approximation Algorithms for a Triangle Enclosure Problem
A Class of Convex Polyhedra with Few Edge Unfoldings
Approximations of Geodesic Distances for Incomplete Triangular Manifolds
Non-Crossing Matching of Online Points
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons
Problems on One Way Road Networks
Core-Preserving Algorithms
O-Convexity Computing Hulls Approximations and Orientation Sets
Computing Voronoi Diagrams of Line Segments Reliably and Efficiently
Input-Sensitive Reconfiguration of Sliding Cubes
Hidden Mobile Guards in Simple Polygons
Recognition of Largest Empty Orthoconvex Polygon in a Point Set
Dent and Staircase Visibility
A quadratic non-standard arthmetic
Removing degeneracies by perturbing the problem or perturbing the world
The convex hull in a new model of computation
An Efficient Solution to the Zookeeper's Problem
Light edges in degree-constrained graphs
Vertex-Transplants on a Convex Polyhedron
A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic
Guaranteed Voronoi Diagrams of Uncertain Sites
I/O-efficient triangular range search and its application
Towards overcoming the reranking bottleneck
Euclidean Freeze-Tag Problem on Plane
A MapReduce Algorithm for Metric Anonymity Problems
Visibility Graph of a Set of Line Sements: A Dynamic Sequential Algorithm and Its Parallel Version
On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes
On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions
Optimal Polyline Simplification under the Local Fréchet Distance in 2D in (Near-)Quadratic Time
On Polyhedra Induced by Point Sets in Space
A Simple Streaming Algorithm for Minimum Enclosing Balls
Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations
Computational Geometry for Interrogative Visualization
Reconstruction of Parallel Line Segments From Endpoint Visibility Information
On a Cone Covering Problem
Drawing some planar graphs with integer edge-lengths
Inner diagonals of convex polytopes
On the Complexity of Halfspace Volume Queries
The Ordinary Line Problem Revisited
On the crossing number of symmetric configurations
Convex blocking and partial orders on the plane
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs
Shortest Paths for a Two-robot Rendez-vous
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
Weak Matching Points with Triangles