yusuke1997/dblp-id-title huggingface dataset:
A fast algorithm for updating a labeling to avoid a moving point
Minimum Selective Subset on Some Graph Classes
Dissections, cuts and triangulations
The width of a convex set on the sphere
Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete
Enumerating Minimal Transversals of Geometric Hypergraphs
Geometric Unique Set Cover on Unit Disks and Unit Squares
Almost Online Square Packing
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions
Computational analysis of 4-8 meshes with application to surface simplification using global error
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles
Small Weak Epsilon-Nets in Three Dimensions
Approximation Schemes for Covering and Packing in the Streaming Model
Variable Radii Poisson Disk Sampling
Largest Subsets of Triangles in a Triangulation
Graph Drawings with Relative Edge Length Specifications
Minimum-Cost Load-Balancing Partitions
On Upward Book Embeddability of DAGs
Conflict-Free Chromatic Guarding of Orthogonal Polygons with Sliding Cameras
Recognition of Triangulation Duals of Simple Polygons With and Without Holes
Continuous foldability of polygonal paper
The 3-dimensional searchlight scheduling problem
Linear-Space Algorithms for Distance Preserving Embedding
Kernelizing Buttons and Scissors
Attraction-convexity and Normal Visibility
Rectilinear short path queries among rectangular obstacles
Maximum geodesic routing in the plane with obstacles
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane
Robust Construction of the Voronoi Diagram of a Polyhedron
Vector Weighted Anisotropic Voronoi Diagrams and Delaunay Traingulations
Homothetic Triangle Contact Representations of Planar Graphs
Turning Orthogonally Convex Polyhedra into Orthoballs
The visibility region of points in a simple polygon
Three-Coloring Three-Dimensional Uniform Hypergraphs
Approximating Metric Depth Queries
A Topologically Convex Vertex-Ununfoldable Polyhedron
Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric
Improved upper bounds for the Heilbronn's Problem for k-gons
Unfolding polyhedral bands
Computational Geometry on Optical Multi-Trees (OMULT) Computer System
ZHED is NP-complete
Determining Weak External Visibility of Polygons in Parallel
Proximate point searching
Grid Proximity Graphs: LOGs, GIGs and GIRLs
Data Structures for Restricted Triangular Range Searching
Time-optimal Proximity Graph Computations on Enhanced Meshes
On the Complexity of Point Recolouring in Geometric Graphs
Algorithms for Ham Sandwich Cuts
On the multiple label placement problem
Maximum Subbarcode Matching and Subbarcode Distance
The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon
Computing the Coverage of an Opaque Forest
Touring a Sequence of Line Segments in Polygonal Domain Fences
Unfolding some classes of orthogonal polyhedra
A practical approach to approximating diameter of point-set in low dimensions
Extensions of the Maximum Bichromatic Separating Rectangle Problem
A locally optimal triangulation of the hyperbolic paraboloid
New Results in Sona Drawing: Hardness and TSP Separation
Cut Locus Realizations on Convex Polyhedra
Vertex Pops and Popturns
New results on Pseudo-triangulations with low vertex degree
Convex Hulls of Bounded Curvature
Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space
Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane
Adaptive Techniques to find Optimal Planar Boxes
Finding specified sections of arrangements: 2d results
The Rectilinear Marco Polo Problem
Packing Boundary-Anchored Rectangles
Compactly Encoding and Decoding the Connectivity of a Plane Graph in Linear Time
Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes
Reflections in an Octagonal Mirror Maze
Approximability of (Simultaneous) Class Cover for Boxes
Drawing series-parallel graphs on a box
Characterization of Polygons Searchable by a Boundary 1-Searcher
Encompassing colored crossing-free geometric graphs
An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments
Boundary Refinement in Delaunay Mesh Generation Using Arbitrarily Ordered Vertex Insertion
Lower bounds for expected-case planar point location
Dynamic Products of Ranks
Speed-constrained geodesic fréchet distance inside a simple polygon
ZEA - A zero-free exact arithmetic
Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard
Characterizing Delaunay Graphs via Fixed Point Theorem
Local properties of geometric graphs
Computational Topology in Reconstruction, Mesh Generation, and Data Analysis
Searching for Frequent Colors in Rectangles
Generalized jewels and the point placement problem
An Output Sensitive Algorithm for the Computation of Shadow Boundaries
Range aggregate structures for colored geometric objects
Surface-to-surface intersection based on triangular parameter domain subdivision 100
Every Combinatorial Polyhedron Can Unfold with Overlap
The spanning ratio of the Delaunay triangulation is greater than pi/2
Randomizing Optimal Geometric Algorithms
Encoding a triangulation as a permutation of its point set
On the number of line tangents to four triangles in three-dimensional space
Minimal Tetrahedralizations of a Class of Polyhedra
Partitioned neighborhood spanners of minimal outdegree
A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon
Sequential Dependency Computation via Geometric Data Structures
Distance Preserving Terrain Simplification - An Experimental Study
Minimizing Uncertainty through Sensor Placement with Angle Constraints
Algorithms on Polygonal Embeddings of Graphs
On Planar Path Transformation
Polygons Folding to Plural Incongruent Orthogonal Boxes
Decomposition of planar motions into reflections and rotations with distance constraints
Linear Binary Space Partitions and the Hierarchy of Object Classes
Multi-guard covers for polygonal regions
Direction assignment in wireless networks
xy-Monotone Path Existence Queries in a Rectilinear Environment
Covering a set of points by two axis-parallel boxes
Computing the Widest Empty Boomerang
Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons
Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments
City Guarding with Limited Field of View
Polynomial irreducibility testing through Minkowski summand computation
On the Fréchet distance of a set of curves
Partitioning a Polygon into Two Mirror Congruent Pieces
On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon
Guaranteed 3.67v bit encoding of planar triangle graphs
The En Route Truck-Drone Delivery Problem
A Topology Oriented Algorithm for the Voronoi Diagram of Polygons
Viewing a Set of Spheres while Moving on a Linear Flightpath
Slant/Gokigen Naname is NP-complete
Reverse Rush Hour is NP-Complete
On the Planar Spherical Depth and Lens Depth
Open Problems from CCCG 2016
Hyperplane depth and nested simplices
Experimental Comparison of the Cost of Approximate and Exact Convex Hull Computation in the Plane
Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks
Rigid Components of Random Graphs
On the hardness of turn-angle-restricted rectilinear cycle cover problems
Proximity drawings of binary trees in polynomial area
Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon, Saskatchewan, Canada
Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies
Finding monochromatic l-shapes in bichromatic point sets
Polygons Cuttable by a Circular Saw
Improved Wake-Up Time For Euclidean Freeze-Tag Problem
Existence of zone diagrams in compact subsets of uniformly convex spaces
Towards a contour morphing preserving differentiability
A combinatorial maximum cover approach to 2D translational geometric covering
Dynamic data structures for approximate Hausdorff distance in the word RAM
Minimum-area drawings of plane 3-trees
Computing Batched Depth Queries and the Depth of a Set of Points
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada
Improved Algorithms for Burning Planar Point Sets
Computational complexity and an integer programming model of Shakashaka
Upward Order-Preserving 8-Grid-Drawings of Binary Trees
On the Geometry of Stable Steiner Tree Instances
Nonorthogonal polyhedra built from rectangles
A Separator Theorem for Intersecting Objects in the Plane
Approximating the Directed Hausdorff Distance
Sharing a Pizza: Bisecting Masses with Two Cuts
Hinged dissections of polyominoes and polyforms
On Non-smooth Convex Distance Functions
Minimum spanning trees on polyhedra
Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths
Sampling and reconstructing manifolds using alpha-shapes
An O(n 5/2 log n) Algorithm for the Rectilinear Minimum Link-Distance Problem
Sphere Packing with Limited Overlap
The Colored Quadrant Priority Search Tree with an Application to the all-nearest-foreign-neighbors Problem
Tutte's barycenter method applied to isotopies
On Density Extrema for Digital '1-Balls in 2D and 3D
Improving Accuracy of GNSS Devices in Urban Canyons
Triangle Guarding
Competitive Routing on a Bounded-Degree Plane Spanner
On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions
Exact Solutions for the Geometric Firefighter Problem
Quantitative Helly-type Hypergraph Chains
Towards a realistic upper bound for the number of facets of 3-dimensional dirichlet stereohedr
Routing with Guaranteed Delivery on Virtual Coordinates
Guarding a Treasury
Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning
Push-* is NP-hard
Partitioning Colored Points into Monochromatic Islands is NP-Complete
Structural filtering: A paradigm for efficient and exact geometric programs
The τ-Skyline for Uncertain Data
Set Cover and Hitting Set Problems for Some Restricted Classes of Rectangles
One Hop Greedy Permutations
Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada
Tetrahedralization of Simple and Non-Simple Polyhedra
An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions
On algorithms for simplicial depth
Approximating Full Steiner Tree in a Unit Disk Graph
Computing Acute and Non-obtuse Triangulations
Convexity minimizes pseudo-triangulations
Observations and Computations in Sylvester-Gallai Theory
An Acrophobic Guard Watchtower Problem on Terrains
Finding a Lost Treasure in Convex Hull of Points From Known Distances
On the Dilation of Delaunay Triangulations of Points in Convex Position
Robust approximate assembly partitioning
Simple algorithms for orthogonal upward drawings of binary and ternary trees
Approximating contact-area of supports in layered manufacturing
Constructing median constrained minimum spanning tree
Evading equilateral triangles without a map
Divide-and-Conquer 3D Convex Hulls on the GPU
Short interlocked linkages
Smallest k point enclosing rectangle of arbitrary orientation
Forest-Like Abstract Voronoi Diagrams in Linear Time
Edge-tracing algorithm for euclidean voronoi diagram of 3d spheres
Monochromatic simplices of any volume
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint
Improved Upper Bounds on the Reflexivity of Point Sets
Geometric tree graphs of points in the plane
An algorithm for the MaxMin area triangulation of a convex polygon
On Bus Graph Realizability
Combinatorics of Minkowski decomposition of associahedra
Blind Voronoi Game
Reconstruction of 3-D surface object from its pieces
Nearest neighbor search through function minimization
Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane
Dynamic updates of succinct triangulations
Heaviest Induced Ancestors and Longest Common Substrings
On the Budgeted Hausdorff Distance Problem
The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
Local Frechet Permutation
One of Ferran Hurtado's favorite topics - Flips
Constructing differentiable homeomorphisms between isomorphic triangulations
Straight-line Orthogonal Drawing of Complete Ternary Tree Requires O(n1.032) Area
A Slow Algorithm for Computing the Gabriel Graph with Double Precision
Minimum Many to Many Matchings for Computing the Distance Between Two Sequences
The exact balanced upper chromatic number of the n-cube over t elements
Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices
Graph Realization on a Random Embedding
Precise flattening of cubic Bézier segments
Banana spiders: A study of connectivity in 3d combinatorial rigidity
Defining and computing accessibility radius
On the Number of Forceless Hint Sequences in Paint-by-Numbers Puzzles
Computing Representatives of Persistent Homology Generators with a Double Twist
On the generation of topological (nk)-configurations
Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time
Red-Blue-Partitioned MST, TSP, and Matching
On the Diameters of Reconfiguration Graphs and ZDD-Based BFS-Algorithm for Optimal Reconfiguration Problems of Optimal Ladder Lotteries
The Exact Routing and Spanning Ratio of arbitrary triangle Delaunay graphs
A remark on the Erdös-Szekeres theorem
Directed rectangle visibility graphs have unbounded dimension
Hausdorff Edit Distance
Metric and Path-Connectedness Properties of the Fréchet Distance for Paths and Graphs
The Size of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensions
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011
Extending the Power of Snap Rounding Variants
Invited talk: Algorithms for Geometric Similarity
Optimal encoding of triangular and quadrangular meshes with fixed topology
Graph Mover's Distance: An Efficiently Computable Distance Measure for Geometric Graphs
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles
Connecting points in the presence of obstacles in the plane
Some problems on approximation of set of points by polygonal curves
Distance-based Subdivision for Translational LP Containment
Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models
Routing in a Polygonal Terrain with the Shortest Beacon Watchtower
Finding the Largest M-dimensional Circle in a K-dimensional Box
Bold Graph Drawings
Computing bitangents for ellipses
Fast Stabbing of Boxes in High Dimensions
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Pathsin a Metric Space
On the Strengthening of Topological Signals in Persistent Homology through Vector Bundle Based Maps
Additively Weighted Voronoi Diagram on the Oriented Projective Plane
Building Discrete Self-Similar Fractals in Seeded Tile Automata
Tilers, Tilemakers, Transformers!
Generalizing Combinatorial Depth Measures to Line Segments
A Multicover Nerve for Geometric Inference
The Area Partitioning Problem
Molecular graphs of a finite points set: a generalization of the Delaunay triangulation
Degree Bounds for Constrained Pseudo-Triangulations
An Improved Kernel for the Flip Distance Problem on Simple Convex Polygons
Common Developments of Three Different Orthogonal Boxes
Integral Unit Bar-Visibility Graphs
Triangulating and Guarding Realistic Polygons
Memory-Constrained Algorithms for Shortest Path Problem
The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon
Touring Convex Bodies - A Conic Programming Solution
Robustness of topology of digital images and point clouds
An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem
Some results on geometric independency trees
Reconstructing Polygons From X-Rays
Non-Shellable Drawings of K n with Few Crossings
A generalized fortress problem using k-consecutive vertex guards
Convex group clustering of large geo-referenced data sets
Approximate Range Closest-Pair Search
Approximate Shortest Descent Path on a Terrain
Collinearities in Kinetic Point Sets
Understanding discrete visibility and related approximation algorithms
Efficient answering of polyhedral queries in r d using bbs-trees
Packing Plane Spanning Trees into a Point Set
On Parallel Rectilinear Obstacle-avoiding Paths
Guarding Polygons With Mutually Visible π-Guards
Grazing inside a Convex Polygon
The spanning ratios of beta-Skeleton
Well-Separated Multiagent Path Traversal
Improved Layouts of the Multigrid Network
Approximating the piercing number for unit-height rectangles
A Pumping Lemma for Homometric Rhythms
Discretized Approaches to Schematization
Weighted shortest path in equilateral triangular meshes
Note on the Pair-Crossing Number and the Odd-Crossing Number
Persistent Spatial Relations - a Systems Design Objective
The Solution Path of the Slab Support Vector Machine
GeoLab: An Environment for Development of Algorithms in Computational Geometry
On the worst-case complexity of the silhouette of a polytope
Open Problems from CCCG 2008
Intersection Detection and Computation of Manhattan Terrains
Algorithms for bivariate medians and a fermat-torricelli problem for lines
On a Geometric Approach to the Segment Sum Problem and Its Generalization
On k-Enclosing Objects in a Coloured Point Set
Finding and Maintaining Rigid Components
Weak Visibility Queries in Simple Polygons
Face-Guarding Polyhedra
Ramsey-type results for unions of comparability graphs and convex sets inrestricted position
Bumpy Pyramid Folding
An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane
On sampling and reconstructing surfaces with boundaries
Fault-Tolerant Euclidean k-Centres
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs
3D Skeletonization as an Optimization Problem
The gaussian centre and the projection centre of a set of points in r 3
Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
Proceedings of the 31st Canadian Conference on Computational Geometry, CCCG 2019, August 8-10, 2019, University of Alberta, Edmonton, Alberta, Canada
Large k-D Simplices in the d-Dimensional Cube
Local Overlaps In Special Unfoldings Of Convex Polyhedra
An Inequality on the Edge Lengths of Triangular Meshes
The Most-Likely Skyline Problem for Stochastic Points
Trajectory Planning for an Articulated Probe
Kinematic Joint Recognition in CAD Constraint Systems
Ecient Segment Folding is Hard
Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014
Circular Ray Shooting: Slower but Surer
Fréchet Distance Between Two Point Sets
Constructing convex 3-polytopes from two triangulations of a polygon
Transforming Hierarchical Trees on Metric Spaces
Matching points to a convex polygonal boundary
Bottleneck Segment Matching
Improved Orthogonal Drawings of 3-graphs
Efficient polygon enclosure algorithms for device extraction from VLSI layouts
Maintaining Light Spanners via Minimal Updates
Computing Largest Circles Separating Two Sets of Segments
The Complexity of a Pop-Up Book
I/O efficient path traversal in well-shaped tetrahedral meshes
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics
Optimal Data Structures for Farthest-Point Queries in Cactus Networks
Enumeration of Polyominoes for p4 Tiling
On the number of simplicial complexes in R d
Approximating the shortest path in line arrangements
Any monotone boolean function can be realized by interlocked polygons
On Computing Shortest External Watchman Routes for Convex Polygons
Rep-cubes: Unfolding and Dissection of Cubes
The Kinetic Hourglass Data Structure for Computing the Bottleneck Distance of Dynamic Data
On the Triangulation of non-fat Imprecise Points
Some Qualitative Properties of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensions
Total Domination in Geometric Unit Disk Graphs
Open Problems from CCCG 2024
Voronoi Games and Epsilon Nets
Tight Bounds for Point Recolouring
Approximating range-aggregate queries using coresets
Open problem session
The Contrained Delaunay Pyramid - A Model for Reconstructing Surfaces at Multiple Resolutions
Nonoverlapping Grid-aligned Rectangle Placement for High Value Areas
An optimal solution for dynamic polar diagram
Proximity Problems on Line Segments Spanned by Points
Conflict-free Covering
An anisotropic cardinality bound for triangulations
Searching by Panning and Zooming
Convex covers in higher dimensions
Planar Pixelations, Shape Reconstruction
One-Round Discrete Voronoi Game in ℝ 2 in Presence of Existing Facilities
A Robust Algorithm for Point in Polyhedron
Parallel edge flipping
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings
Distributed Unit Clustering
Folding Polyominoes with Holes into a Cube
Planar Visibility Graphs
Building Patterned Shapes in Robot Swarms with Uniform Control Signals
Convex drawings of intersecting families of simple closed curves
Covering Grids by Trees
Dynamic Well-Separated Pair Decomposition Made Easy
Computing a planar widest empty alpha-siphon in o(n 3 ) time
I/O Optimal Data Structures for Categorical Range Skyline Queries
Straight Line Embeddings of Planar Graphs on Point Sets
K-Guarding Polygons on the Plane
On the Biplanar and k-Planar Crossing Numbers
Flipping your Lid
On the variance of random polygons
Reconfiguring Convex Polygons
Approximation Algorithms for the Minimum-Length Corridor and Related Problems
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada
Searching for the Center of an Ellipse
Drawing the Horton Set in an Integer Grid of Minimun Size
The Cover Contact Graph of Discs Touching a Line
Small Octahedral Systems
Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points
Proceedings of the 13th Canadian Conference on Computational Geometry, University of Waterloo, Ontario, Canada, August 13-15, 2001
On Fence Patrolling by Mobile Agents
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas
On Minimum and Maximum Visibility Problem
Variable Resolution Terrain Surfaces
A Simple Randomized Algorithm for All Nearest Neighbors
Approximation Algorithms for the Euclidean Dispersion Problems
Edge Guards for Polyhedra in 3-Space
Data Structures for Range-Aggregate Extent Queries
Geometric clustering models for multimedia databases
On k-Guarding Polygons
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid
Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results
Width and Bounding Box of Imprecise Points
Numerically Robust Algorithm for Contructing Constrained Delaunay Triangulation
Dimension Detection with Local Homology
Planar Packing of Diameter-Four Trees
Online Square Packing with Predictions
New Bounds for Facial Nonrepetitive Colouring
Teaching Computational Geometry, II
Watchman routes in the presence of a pair of convex polygons
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique
Complete combinatorial generation of small point configurations and hyperplane arrangements
Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs
Compatible 4-Holes in Point Sets
On the conversion of ordinary voronoi diagrams into laguerre diagrams
Cinderella: Computation, complexity, geometry
A reliable algorithm for computing the generalized voronoi diagram for a set of spheres in the euclidean d-dimensional space
Cutting Out Polygons
Optimal Point Set Partitioning using Rigid Motion Star Placement