yusuke1997/dblp-id-title huggingface dataset:
A 13/9-approximation of the average-2π/3-MST
Kinetically-aware Conformational Distances in Molecular Dynamics
An Incremental Algorithm for High Order Maximum Voronoi Diagram Construction
Walking in the visibility complex with applications to visibility polygons and dynamic visibility
Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n
Linear-Size Meshes
Finding Optimal Geodesic Bridges Between Two Simple Polygons
On the Smallest Enclosing Information Disk
Computing closest points for segments
Partition, Reduction, and Conquer: A Geometric Feature-Based Approach to Convex Hull Computation
Edge-Unfolding Prismatoids: Tall or Rectangular Base
Lower Bounds for the Complexity of the Hausdorff Distance
Geometric Orderings and Helly-type Theorem for Intersecting Translates in the Plane
External Exploration of a Convex Polygon
Visibility Monotonic Polygon Deflation
Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montréal, Québec, Canada, August 10-12, 1998
Optimal Slope Selection Via Cuttings
Solving online feasibility problem in constant amortized time per update
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
Domino tilings and two-by-two squares
Optimal Delivery with a Faulty Drone
Approximation and Hardness of Polychromatic TSP
Heuristics for the Generation of Random Polygons
A Fast Dimension-Sweep Algorithm for the Hypervolume Indicator in Four Dimensions
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d
On Totally-Concave Polyominoes
Strongly Connected Spanning Subgraph for Almost Symmetric Networks
Jin akiyama
Faster approximation for Symmetric Min-Power Broadcast
Diameter of a set on the cylinder
Low Level Issues in Computational Geometry
Stabbing Line Segments with Disks and Related Problems
Parallel algorithms for longest increasing chains in the plane and related problems
Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm
On the Permutations Generated by Rotational Sweeps of Planar Point Sets
On the Shooter Location Problem
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
Finding Shadows among Disks
Three-dimensional 1-bend graph drawings
Restricted Edge Contractions in Triangulations of the Sphere with Boundary
On sequential triangulations of simple polygons
Using simplicial partitions to determine a closest point to a query line
The Medial Axis of a Union of Balls
An Efficient Exact Algorithm for the Natural Wireless Localization Problem
Visibility Testing and Counting for Uncertain Segments
Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area
The Median Line Segment Problem: Computational Complexity and Constrained Variants
Formigrams: Clustering Summaries of Dynamic Data
Grid-edge unfolding orthostacks with rectangular slabs
Time-Windowed Closest Pair
Geometric matching problem of disjoint compact convex sets by line segments
Generalizations of Interval Graphs
Space-Efficient Algorithms for Klee's Measure Problem
Geometric Pattern Matching Under Euclidean Motion
Rectangle Stabbing and Orthogonal Range Reporting Lower Bounds in Moderate Dimensions
Approximating the Minimum Closest Pair Distance and Nearest Neighbor Distances of Linearly Moving Points
2D Triangulation Representation Using Stable Catalogs
Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain
A Note on Minimum-Segment Drawings of Planar Graphs
Space Filling Curves for 3D Sensor Networks with Complex Topology
Visibility Graphs, Dismantlability, and the Cops and Robbers Game
Polygons Flip Finitely: Flaws and a Fix
Some Polycubes Have No Edge Zipper Unfolding
Approximating optimal paths in terrains with weight defined by a piecewise-linear function
The complexity of domino tiling
Searching for the center of a circle
Generalized Watchman Route Problem with Discrete View Cost
Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315
Turning Around and Around: Motion Planning through Thick and Thin Turnstiles
Threadable Curves
Short cuts in higher dimensional space
The Floodlight Problem
Geometric Separators and the Parabolic Lift
Detecting VLSI Layout, Connectivity Errors in a Query Window
Hierarchical Delaunay Triangulation
Transversals to line segments in R 3
Budgeted Steiner Networks: Three Terminals with Equal Path Weights
Dynamic Schnyder woods
Exploring Increasing-Chord Paths and Trees
Diversity Maximization via Composable Coresets
Minimum Convex Container of Two Convex Polytopes under Translations
Algorithms for Bivariate Majority Depth
Analysis of a class of k-dimensional merge procedures, with an application to 2d delaunay triangulation in expected linear time after two-directional sorting
Exact and approximation algorithms for computing a -fat decompositions
Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks
Recovering lines with fixed linear probes
Consecutive Guards
On Directed Graphs with an Upward Straight-line
Approximating Maximum Flow in Polygonal Domains using Spanners
Hinged Dissection of Polygons is Hard
A Fast Algorithm for Point Labeling Problem
Constrained Obnoxious Facility Location on a Line Segment
Two-Guard Art Gallery Problem
Red-Blue Point Separation for Points on a Circle
Removing Outliers to Minimize Area and Perimeter
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices
On Rectangle Visibility Graphs. III. External Visibility and Complexity
Link-2-Convex One-Fillable Polygons are Starshaped
Maintaining partitions of dynamic planar meshes
Topological Walk Revisited
Competitive Search for Longest Empty Intervals
Generalized LR-Drawings of Trees
Making contour trees subdomain-aware
On a disjoint quadrilateral partition for a given point se
Geometric Graphs with Unbounded Flip-Width
Some methods to determine the sign of a long integer from its remainders
Shortest paths and visibility inside triangulated curved polygons with applications to conic visibility
Minimum Enclosing Spherical/Cylindrical Shells in High-Dimensional Streams
Polynomial volume point set embedding of graphs in 3D
Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching
Colored Simultaneous Geometric Embeddings and Universal Pointsets
Orthogonal Dissection into Few Rectangles
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009
Parallel morphing of trees and cycles
Sweeping x-monotone pseudolines
Inapproximability of some art gallery problems
A Constant Time Algorithm for Solving Simple Rolling Cube Mazes
Edge-guarding Orthogonal Polyhedra
Orthogonal thickness of graphs
Enclosing K Points in the Smallest Axis Parallel Rectangle
Optimal Polygon Placement
Boundary Labeling with Obstacles
Computing the Dent Diameter of a Polygon
On the number of star-shaped polygons and polyhedra
Relaxed Gabriel Graphs
A simpler circular ray shooting algorithm
Connected dominating sets on dynamic geometric graphs
Mapping Data to Dimensions of Perceptual Space
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs
Critical Placements of a Square or Circle amidst Trajectories for Junction Detection
On polygons excluding point sets
On Stable Line Segments in Triangulations
A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines
1-bend 3-D orthogonal drawings: two open problems solved
On the Fewest Nets Problem for Convex Polyhedra
Rapid prototyping of geometric models
Straight-line embeddings of three rooted trees in the plane
Computing the Shift-Invariant Bottleneck Distance for Persistence Diagrams
Planar case of the maximum box and related problems
Periodic b-spline surface skinning of anatomic shapes
Discrete Surveillance Tours in Polygonal Domains
Transformations and algorithms for least sum of squares hypersphere fitting
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots
Optimal Empty Pseudo-Triangles in a Point Set
A lower bound on the number of colours needed to nicely colour a sphere
Burning Simple Polygons
On Bipartite Matching under the RMS Distance
Constant-Working-Space Algorithms for Geometric Problems
Euclidean proximity and power diagrams
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment
On a partition of point sets into convex polygons
Practical and Efficient Geometric Epsilon-Approximations
Geometric Spanners Merging and its Applications
Intrinsic Multiscale Geometry
Algorithms for Minimizing the Movements of Spreading Points in Linear Domains
Folding Rulers inside Triangles
A stronger version of Bárány's theorem in the plane
Shooter location problems revisited
Quasigeodesics on the Cube
Bernstein based arithmetic featuring de Casteljau
An on-line algorithm for exploring an unknown polygonal environment by a point robot
Watchman route in a simple polygon with a rubberband algorithm
On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles
Contracted visibility graphs of line segments
Aperture angle optimization problems
Hunting Voronoi Vertices in Non-Polygonal Domains
Overlapping of Lattice Unfolding for Cuboids
On the complexity of embedding in graph products
Unfolding Some Classes of One-Layer Polycubes
Fast Deterministic Approximation of Medoid in R d
Computing the Caratheodory Number of a Point
A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections
Logarithmic path-length in space-filling curves
Finding the largest axis aligned rectangle in a polygon in o(n log n) time
Motivating lazy guards
Unfolding Polyhedra
On General Properties of Strictly Convex Smooth Distance Functions in R D
Fast Approximate Lipschitz Extensions in Doubling Metrics
A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron
Designing Modern Linkages to Trace Bezier Curves
On the perimeter of fat objects
Multirobot Watchman Routes in a Simple Polygon
An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen's University, Ontario, Canada
Computing faces up to k dimensions of a Minkowski Sum of Polytopes
Efficient Graph Reconstruction and Representation Using Augmented Persistence Diagrams
Rigidity-Theoretic Constructions of Integral Fary Embeddings
Incremental construction properties in dimension two-- shellability, extendable shellability and vertex decomposability
On Graph Thickness, Geometric Thickness, and Separator Theorems
On Error Representation in Exact-Decisions Number Types
Reaching folded states of a rectangular piece of paper
Away from Rivals
Basis Enumeration of Hyperplane Arrangements Up to Symmetries
Hardness results on Voronoi, Laguerre and Apollonius diagrams
Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon
On the Pagenumber of Bipartite Orders
Orthogonal Range Search using a Distributed Computing Model
Listing all connected plane triangulation
Finding the Maximum Area Axis-parallel Rectangle in a Polygon
Shortest paths in convex and simple weighted polygons
Spanning Tree, Matching, and TSP for Moving Points: Complexity and Regret
Tight Linear Lower Memory Bound for Local Routing in Planar Digraphs
Oblivious Median Slope Selection
On a Problem of Immobilizing Polygons
Maximum Overlap Area of Several Convex Polygons Under Translations
Simplification of Scalar Data via Monotone-Light Factorizations
On the Maximum Span of Fixed-Angle Chains
Snipperclips: Cutting Tools into Desired Polygons using Themselves
Extending Rectangular Range Reporting with Query Sensitive Analysis
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs
Parallel Line Centers with Guaranteed Separation
Unstacking Slabs Safely in Megalit is NP-Hard
An Incidence Geometry Approach to Dictionary Learning
Rectangular Unfoldings of Polycubes
Aperture-angle optimization problems in 3 dimensions
Drawing some 4-regular planar graphs with integer edge lengths
Computational complexity of numberless Shakashaka
Automatically Testing Containedness between Geometric Graph Classes defined by Inclusion, Exclusion and Transfer Axioms
Topological Characterization of Hwang's Optimal Steiner Trees
Computational Euclid
2048 Without Merging
Guarding in a simple polygon
Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2
Axis-Aligned Square Contact Representations
Covering Points on a Circle with Circular Arcs
Equiprojective Polyhedra
Tiling layouts with dominoes
Hamiltonian Cycles in Triangular Grids
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montréal, Canada, August 13-15, 2008
Computing Motorcycle Graphs Based on Kinetic Triangulations
Flipping in Spirals
Computing the straight skeleton of a monotone polygon in O(n log n) time
A Disk-Covering Problem with Application in Optical Interferometry
Point Location in Well-Shaped Meshes Using Jump-and-Walk
On degeneracy of lower envelopes of algebraic surfaces
Epsilon-covering: a greedy optimal algorithm for simple shapes
New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment Model
A vertex-face assignment for plane graphs
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane
Proceedings of the 9th Canadian Conference on Computational Geometry, Kingston, Ontario, Canada, August 11-14, 1997
Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness
1-string B1-VPG-representations of planar partial 3-trees and some subclasses
A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem
Good approximations for the relative neighbourhood graph
Finding Intersections of Algebraic curves in a Convex Region using Encasement
A Note on Interference in Random Networks
An Optimal Solution to Room Search Problem
Angles of Arc-Polygons and Lombardi Drawings of Cacti
Edge Guards on a Fortress
The Harmony of Spheres
Ghost chimneys
The Orthogonal Two-Line Center Problem
Finding minimal bases in arbitrary spline spaces
Finding Minimum Witness Sets in Orthogonal Polygons
Euclidean Movement Minimization
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada
Empty Monochromatic Triangles
Finding an o(n 2 log n) Algorithm Is Sometimes Hard
Fault Tolerant Clustering Revisited
The Mutual Visibility Problem for Oblivious Robots
Rearranging a Sequence of Points onto a Line
On the Inverse Beacon Attraction Region of a Point
Constant Delay Lattice Train Schedules
On computing enclosing isosceles triangles and related problems
Counting triangulations and pseudo-triangulations of wheels
Controlling Guards
Determining the robustness of sensor barriers
Maintaining the Approximate Width of a Set of Points in the Plane
A straight-line embedding of two or more rooted trees in the plane
On the Coverage of Points in the Plane by Disks Centered at a Line
Maximum Area Rectangle Separating Red and Blue Points
On Compatible Triangulations with a Minimum Number of Steiner Points
Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding
Finding the Maximum Area Parallelogram in a Convex Polygon
On reverse nearest neighbor queries
Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations
Vertex pi-lights for monotone mountains
Finding a triangular mesh with a constant number of different edge lengths
Finding Segments and Triangles Spanned by Points in R 3
Regular polygons are most tolerant
Network Design Subject to Facility Location
Constrained Delaunay Triangulation Revisited
Three-dimensional Restricted-Orient at Ion Convexity
Perspective projections and removal of degeneracies
Narrowing light rays with mirrors
Robot kabaddi
Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time
Flip Distance Between Two Triangulations of a Point Set is NP-complete
Drawing complete outer-1-planar graphs in linear area
Unfolding Polyhedra via Cut-Tree Truncation
Buttons & Scissors is NP-Complete
Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas
Hardness Results for Computing Optimal Locally Gabriel Graphs
Dominance Drawings of Bipartite Graphs
Rectangle Packing in Polynomial Time
Drawing k 2 , n : A lower bound
Minimal Tangent Visibility Graphs
Push-2-f is pspace-complete
Convexifying star-shaped polygons
Computing the width of a point set in 3-space
Characterization of Shortest Paths on Directional Frictional Polyhedral Surfaces
Maximizing the Minimum Angle with the Insertion of Steiner Vertices
Folding Polyiamonds into Octahedra
Visibility graphs of polygonal rings
The T-Hull Approach to Shape Analysis
Hardness of Approximation for Red-Blue Covering
Area-Proportional Drawings of Intersecting Families of Simple Closed Curves
Robust algorithm for k -gon voronoi diagram construction
Approximate and Exact Geometric Generalized Minimum Spanning Trees
Pushing the boundaries of polytopal realizability
Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria
Yet another look at fractional cascading: B-graphs with application to point location
Guarding Points on a Terrain by Watchtowers
Illumination problems on translation surfaces with planar infinities
Optimal Slope Selection Via Expanders
Minimizing the Solid Angle Sum of Orthogonal Polyhedra and Guarding them with π/2-Edge Guards
Stabbing Information of a Simple Polygon
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
On the Complexity of Assembly Partitioning
An Output-Sensitive Algorithm for Computing the s-Kernel
Nearest-Neighbor Search Under Uncertainty
Translational polygon covering using intersection graphs
Rational Orthogonal Approximations to Orthogonal Matrices
Widest-corridor Problems
Planar Convex Hull Range Query and Related Problems
Partitioning algorithms for transportation graphs and their applications to routing
Convex hull alignment through translation
On the Number of Views of Polyhedral Terrains
Geometry-Free Polygon Splitting
Optimizing a Corridor Between Two Polygons with an Application to Polyhedral Interpolation
Nets of higher-dimensional cubes
Wireless Localization within Orthogonal Polyhedra
Covering Folded Shapes
Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips
K-transversals of Parallel Convex Sets
Squeeze-free Hamiltonian Paths in Grid Graphs
Geometric modeling with a multiresolution representation
Angular rigidity in 3D: combinatorial characterizations and algorithms
Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State Change
Faster approximation algorithms for scheduling tasks with a choice of start times
On shortest paths in line arrangements
Looking for Bird Nests: Identifying Stay Points with Bounded Gaps
The reflex-free hull
The complexity of a single face of a minkowski sum
Decomposing Polygons into Fat Components
Relaxed Disk Packing
High-Dimensional Axis-Aligned Bounding Box with Outliers
Polygon Area Problems
Optimistic shortest paths on uncertain terrains
The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete
Forbidden Configurations in Discrete Geometry
Uniqueness of Optimal Cube Wrapping
Distance-Two Coloring of Barnette Graphs
Cuttings in 2D Revisited
Minimum-Weight Half-plane Hitting Set
Limited Gaps
Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem
New Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem
Simultaneous edge flips for convex subdivisions
Guarding Monotone Polygons with Half-Guards
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
Bounding the Locus of the Center of Mass for a Part with Shape Variation
Maintaining a Centerpoint in the Plane with Amortized Optimal Logarithmic Insertions
Finding a minimal tree in a polygon with its medial axis
Catalan Squares and Staircases: Relayering and Repositioning Gray Codes
An Experimental Analysis of Floating-Point Versus Exact Arithmetic
Improved Bounds for Smallest Enclosing Disk Range Queries
Guarantees on Nearest-Neighbor Condensation heuristics
Widest Empty Corridor with Multiple Links and Right-angle Turns
A Discussion on the Triangulation Refinement Problem
Selecting Independent Chains on a Triangulated 2-Manifold
Direct Planar Tree Transformation and Counterexample
Pricing of Geometric Transportation Networks
On the Use of Adaptive, Exact Decisions Number Types Based on Expression-Dags in Geometric Computing
Computing Covers of Plane Forests
A Fault Tolerant Data Structure for Peer-to-Peer Range Query Processing
Convexifying Polygons Without Losing Visibilities
Hyperplane Distance Depth
Decremental Greedy Polygons and Polyhedra Without Sharp Angles
On the total correctness of lawson's oriented walk algorithm
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull
Monochromatic Plane Matchings in Bicolored Point Set
Casting with skewed ejection direction revisited
Spiralling and Folding: The Topological View
Computing the Geodesic Centers of a Polygonal Domain
Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles
Realizing m-uniform four-chromatic hypergraphs with disks
Simultaneous Visibility Representations of Undirected Pairs of Graphs
Weighted Region Problem in Arrangement of Lines
Recognizing S-Star Polygons
Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling
Cluster connecting problem inside a polygon
An Improved Approximation Factor For The Unit Disk Covering Problem
Folding Points to a Point and Lines to a Line
On Farthest-Point Information in Networks
Restricted-Weight Minimum-Dilation Spanners on Three Points
Shortest Paths in Two Intersecting Pencils of Lines
Optimal Orthogonal Drawings of Connected Plane Graphs
Unfolding Rectangle-Faced Orthostacks
Homeomorphic meshes in R d
GASP - An Animation System for Computational Geometry
Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015
On Dynamic k-d Half-Space Range Reporting
Approximating Shortest Paths in Arrangements of Lines
An Eight-Way Perturbation Technique for the Three-Dimensional Convex Hull
Online Square Packing with Rotation
Some Heuristics for the Homological Simplification Problem
Maximum Independent Set for Intervals by Divide-Prune-and-Conquer
Guarding the Convex Subsets of a Point-set
Stability of voronoi neighborship under perturbations of the sites
Another Paradigm for Geometric Constraints Solving
Constrained Orthogonal Segment Stabbing
The projection median of a set of points in R d
A Space-Efficient Algorithm for Segment Intersection
A Study of Conway's Thrackle Conjecture
How to Cover Most of a Point Set with a V-Shape of Minimum Width
Sufficiently Fat Polyhedra are Not 2-Castable
Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks
On Multi-Dimensional Team Formation
Geometric Red-Blue Set Cover for Unit Squares and Related Problems
Reconstructing Submanifolds of Euclidean Space
Dispersion on Intervals
Spanners in l 1
Experimental analysis of oriented spanners on one-dimensional point sets
Quantile approximation for robust statistical estimation
Applications of Computational Geometry in Architecture
Proceedings of the 15th Canadian Conference on Computational Geometry, CCCG'03, Halifax, Canada, August 11-13, 2003
A PTAS for the Continuous 1.5D Terrain Guarding Problem
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
An Improved Bound for the Affine Sylvester Problem
Computational Geometry of Contour Extraction
On Guarding Orthogonal Polygons with Bounded Treewidth
Planar Graphs with Many Perfect Matchings and Forests
On folding rulers in regular polygons
Non-orthogonal ray guarding
Optimistic and Pessimistic Shortest Paths on Uncertain Terrains