yusuke1997/dblp-id-title huggingface dataset:
Characterizations of Transductions Defined by Abstract Families of Transducers
Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game
Continuous Operations on Languages
Correction: Invariance for Ordinary Differential Equations
Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings
2-Stack Sorting is Polynomial
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
Algebraic and Other Entropies of Group Endomorphisms
Routing and Wavelength Assignment Algorithm for Mesh-based Multiple Multicasts in Optical Network-on-chip
Identification of Control Systems by Performance
Uniform Tag Seqences
Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets
Reducibilities Relating to Schnorr Randomness
On the Largest Full SubAFL of an AFL
Topological Power Automata with Quasi-Power Morphisms
An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D
Higher order Delaunay triangulations
Optimization for first order Delaunay triangulations
Minimum-sum dipolar spanning tree in R 3
Space efficient data structures for dynamic orthogonal range counting
Range closest-pair search in higher dimensions
Augmenting graphs to minimize the radius
Unit Distances Between Vertices of a Convex Polygon
Ice-creams and wedge graphs
Small weak epsilon-nets
On the Distribution of Order Types
On piercing numbers of families satisfying the ( p , q ) r property
Computing Bushy and Thin Triangulations
On triangle cover contact graphs
Bend-optimal orthogonal graph drawing in the general position model
An efficient algorithm for the stratification and triangulation of an algebraic surface
Shortest paths and convex hulls in 2D complexes with non-positive curvature
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Visibility representations of four-connected plane graphs with near optimal heights
A Framework for 1-D Compaction with Forbidden Region Avoidance
Fast vertex guarding for polygons with and without holes
Computing Convex Hull in a Floating Point Arithmetic
Simplifying spline models
Algorithms for the edge-width of an embedded graph
Learning smooth shapes by probing
Intersecting disks using two congruent disks
Polynomial-time Instances of the Minimum Weight Triangulation Problem
Dynamic layers of maxima with applications to dominating queries
On Rectilinear Link Distance
Perturbations for Delaunay and weighted Delaunay 3D triangulations
Acknowledgement of priority - A fractional Helly theorem for boxes
Geometric spanners with small chromatic number
Reporting flock patterns
Optimal and suboptimal robust algorithms for proximity graphs
Algorithms for the multiple label placement problem
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises
The prefix Fréchet similarity
Visibility queries in a polygonal region
Approximation algorithms for geometric conflict free covering problems
The medial axis of a union of balls
The minimum convex container of two convex polytopes under translations
On the 𝒪 β of a planar point set
A lower bound on the number of triangulations of planar point sets
Alternating paths and cycles of minimum length
Simplex Range Reporting on a Pointer Machine
Spirale Reversi: Reverse decoding of the Edgebreaker encoding
Distance measures for embedded graphs
Routing on heavy path WSPD spanners
Partitioning point sets in space into disjoint convex polytopes
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
A tight bound for point guards in piecewise convex art galleries
A (slightly) faster algorithm for Klee's measure problem
Cross-sections of line configurations in R3 and ( d - 2)-flat configurations in Rd
Layered drawing of undirected graphs with generalized port constraints
A robust segment/triangle intersection algorithm for interference tests. Efficiency study
An efficient algorithm for enumeration of triangulations
Approximate proximity drawings
An analytical representation of the 2d generalized balanced power diagram
Ununfoldable polyhedra with convex faces
Optimal Art Gallery Localization is NP-hard
Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations
Thickness and colorability of geometric graphs
Parallel line centers with guaranteed separation
Octants are cover-decomposable into many coverings
More planar two-center algorithms
Complexity of Projected Images of Convex Subdivisions
Routing multi-class traffic flows in the plane
A note on parallel algorithms for optimal h-v drawings of binary trees
Optimal bound for PCA with outliers using higher-degree Voronoi diagrams
I/O-efficient 2-d orthogonal range skyline and attrition priority queues
Reversibility and foldability of Conway tiles
Continuous Yao graphs
On plane geometric spanners: A survey and open problems
Minimum enclosing circle of a set of fixed points and a mobile point
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
Optimal discrete Morse functions for 2-manifolds
Software for exact integration of polynomials over polyhedra
Simple linear time algorithms for piercing pairwise intersecting disks
Multiple covers with balls I: Inclusion-exclusion
Families of polytopal digraphs that do not satisfy the shelling property
Grid drawings of graphs with constant edge-vertex resolution
On finding maximum-cardinality symmetric subsets
Adaptive sampling for geometric problems over data streams
Computing a geodesic two-center of points in a simple polygon
Maximum overlap of convex polytopes under translation
Queries on Voronoi Diagrams of Moving Points
Minimum rectilinear polygons for given angle sequences
Special Issue on the 33rd European Workshop on Computational Geometry, Guest Editors' Foreword
Extended convex hull
How Many Maxima Can There Be?
A result about the density of iterated line intersections in the plane
The minimum weight triangulation problem with few inner points
Morphing polyhedra with parallel faces: Counterexamples
Lower Bounds on Stabbing Lines in 3-space
Fréchet distance between two point sets
Preprocessing chains for fast dihedral rotations is hard or even impossible
A generalized Malfatti problem
Online class cover problem
Efficient view point selection for silhouettes of convex polyhedra
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
Efficient Hidden Surface Removal for Objects with Small Union Size
Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs
On the complexity of the Edge Label Placement problem
Models and motion planning
Weighted straight skeletons in the plane
On k-convex polygons
Attraction-convexity and normal visibility
An Ω( n d ) lower bound on the number of cell crossings for weighted shortest paths in d -dimensional polyhedral structures
Escaping offline searchers and isoperimetric theorems
Competing output-sensitive frame algorithms
Adaptive Subdivision and the Length and Energy of Bézier Curves
A duality transform for constructing small grid embeddings of 3d polytopes
All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers
From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem
Inner and outer approximations of polytopes using boxes
On compact packings of the plane with circles of three radii
Delaunay conforming iso-surface, skeleton extraction and noise removal
The VC-dimension of visibility on the boundary of monotone polygons
A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
Rigid realizations of graphs on small grids
On determining the congruence of point sets in d dimensions
Maximum number of almost similar triangles in the plane
Covering Grids and Orthogonal Polygons with Periscope Guards
Complexity of simplicial homology and independence complexes of chordal graphs
Highway hull revisited
Stable Roommates Spanner
On the computation of an arrangement of quadrics in 3D
Stabbing Isothetic Boxes and Rectangles in O(n Log N) Time
Covering points with minimum/maximum area orthogonally convex polygons
How to draw the minimum cuts of a planar graph
A survey of geodesic paths on 3D surfaces
Realistic roofs over a rectilinear polygon
Packing plane spanning graphs with short edges in complete geometric graphs
A linearized circle packing algorithm
Single facility collection depots location problem in the plane
Remarks on Schur's conjecture
Optimal core-sets for balls
Faster algorithms for growing prioritized disks and rectangles
Gathering by repulsion
On interval decomposability of 2D persistence modules
On the complexity of higher order abstract Voronoi diagrams
On balanced 4-holes in bichromatic point sets
Fast Randomized Parallel Methods for Planar Convex Hull Construction
Inserting an edge into a geometric embedding
Arc diagrams, flip distances, and Hamiltonian triangulations
Competitive on-line coverage of grid environments by a mobile robot
Progressive simplification of polygonal curves
Convex hull of points lying on lines in time after preprocessing
Farthest-polygon Voronoi diagrams
Flip distance to some plane configurations
Measuring and computing natural generators for homology groups
On the number of order types in integer grids of small size
On Hamiltonian alternating cycles and paths
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
k -Sets and rectilinear crossings in complete uniform hypergraphs
Visibility Graphs of Towers
Inner and outer rounding of Boolean operations on lattice polygonal regions
Enumerating combinatorial resultant trees
Sixteenth European Workshop on Computational Geometry - Editorial
On the number of touching pairs in a set of planar curves
An improved algorithm for Kleeʼs measure problem on fat boxes
Floodlight illumination of infinite wedges
Seven mutually touching infinite cylinders
Generating realistic terrains with higher-order Delaunay triangulations
Bounds on the quality of the PCA bounding boxes
On path-greedy geometric spanners
Editorial: Special issue in memory of Dr. Ferran Hurtado
Constrained boundary labeling
Geometric and algorithmic solutions to the generalised alibi query
Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
Improved bounds on the stretch factor of Y 4
Querying two boundary points for shortest paths in a polygonal domain
Maximizing maximal angles for plane straight-line graphs
Clarkson's algorithm for violator spaces
Fixed-parameter tractability and lower bounds for stabbing problems
Simultaneous graph embedding with bends and circular arcs
Path finding for human motion in virtual environments
Preserving geometric properties in reconstructing regions from internal and nearby points
Forest-like abstract Voronoi diagrams in linear time
Computing a Subgraph of the Minimum Weight Triangulation
A sensor-based framework for kinetic data compression
On Compatible Triangulations of Simple Polygons
Ununfoldable polyhedra with 6 vertices or 6 faces
A Competitive Analysis of Algorithms for Searching Unknown Scenes
On the number of views of translates of a cube and related problems
A new 2D tessellation for angle problems: The polar diagram
Automatic generation of formulae for polyominoes with a fixed perimeter defect
SOKOBAN and other motion planning problems
Sparse convex hull coverage
Geometric representation of cubic graphs with four directions
Locality and bounding-box quality of two-dimensional space-filling curves
Abstract Voronoi diagrams revisited
On fat partitioning, fat covering and the union size of polygons
A fast algorithm for computing irreducible triangulations of closed surfaces in 𝔼 d
Reconstructing 3D compact sets
The maximum exposure problem
Structural filtering: a paradigm for efficient and exact geometric programs
On the dilation spectrum of paths, cycles, and trees
Impartial achievement games on convex geometries
Refold rigidity of convex polyhedra
Balanced line separators of unit disk graphs
Constrained CVT meshes and a comparison of triangular mesh generators
On Stabbling Lines for Convex Polyhedra in 3D
How to cover a point set with a V-shape of minimum width
Approximate range searching using binary space partitions
Point-set embeddings of plane 3-trees
Decomposition of geometric graphs into star-forests
Combinatorics of beacon-based routing in three dimensions
Automatic deduction in (dynamic) geometry: Loci computation
Minimum-link paths revisited
Navigating planar topologies in near-optimal space and time
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
Large convex holes in random point sets
Solving the minimum convex partition of point sets with integer programming
Decompositions and boundary coverings of non-convex fat polyhedra
Multicolor Combination Lemma
Planarity-preserving clustering and embedding for large planar graphs
On numbers of pseudo-triangulations
Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments
Editorial CCCG 2006
Approximation of MWIS on geometric intersection graphs
Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
On the number of disjoint convex quadrilaterals for a planar point set
Time and space efficient collinearity indexing
On the line-separable unit-disk coverage and related problems
On the enumeration of integer tetrahedra
Empty monochromatic triangles
Constructing the Convex Hull of a Partially Sorted Set of Points
On the approximation of a smooth surface with a triangulated mesh
Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG)
The mixed volume optimization problem
Structured discrete shape approximation: Theoretical complexity and practical algorithm
Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra
On local transformations in plane geometric graphs embedded on small grids
The rectangle of influence drawability problem
Discrete Fréchet distance for closed curves
On simultaneous planar graph embeddings
Minimum weight pseudo-triangulations
Localized homology
Constrained minimum enclosing circle with center on a query line segment
Efficient compression of non-manifold polygonal meshes
On triconnected and cubic plane graphs on given point sets
Reprint of: Approximating majority depth
Trajectory planning for an articulated probe
Iterated snap rounding
A lower bound for beta-skeleton belonging to minimum weight triangulations
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
Drawing series parallel digraphs symmetrically
The Complexity of Finding Minimal Voronoi Covers with Applications to Machine Learning
Ascending and descending regions of a discrete Morse function
An optimal extension of the centerpoint theorem
Tight stretch factors for L 1 - and L ∞ -Delaunay triangulations
Soft subdivision motion planning for complex planar robots
The most-likely skyline problem for stochastic points
Visibility graphs, dismantlability, and the cops and robbers game
Special Issue on Robust Geometric Algorithms and their Implementations
Counting Problems Relating to a Theorem of Dirichlet
Weak visibility queries of line segments in simple polygons
Towards Exact Geometric Computation
How close is a quad mesh to a polycube?
Isometric and affine copies of a set in volumetric Helly results
Distinct distances with ℓ p metrics
Shortcuts for the circle
Longest convex lattice chains
Extremal point queries with lines and line segments and related problems
Efficient and robust persistent homology for measures
Topological regularization via persistence-sensitive optimization
Constrained paths in the flip-graph of regular triangulations
New Results on Binary Space Partitions in the Plane
Efficient transformations for Klee's measure problem in the streaming model
Schematization of networks
Extending Erdős-Beck's theorem to higher dimensions
Orthogonal segment stabbing
Facility location and the geometric minimum-diameter spanning tree
Panel-point model for rigidity and flexibility analysis of rigid origami
Further results on arithmetic filters for geometric predicates
An elementary algorithm for reporting intersections of red/blue curve segments
On pseudo-disk hypergraphs
Enumerating the k best plane spanning trees
Closed rectangle-of-influence drawings for irreducible triangulations
Compatible triangulations and point partitions by series-triangular graphs
Finding pairwise intersections of rectangles in a query rectangle
Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization
Homotopic 𝒞-oriented routing with few links and thick edges
Face-guarding polyhedra
Configurations with few crossings in topological graphs
Line-segment intersection made in-place
Approximate range closest-pair queries
On finding widest empty curved corridors
Covering a simple polygon by monotone directions
Independent set of intersection graphs of convex objects in 2D
On d-regular schematization of embedded paths
A linear-time algorithm for radius-optimally augmenting paths in a metric space
How to play hot and cold
Rotationally monotone polygons
Area bounds of rectilinear polygons realized by angle sequences
Probing convex polygons with a wedge
Polynomial area bounds for MST embeddings of trees
The weighted farthest color Voronoi diagram on trees and graphs
Optimal time-convex hull for a straight-line highway in L p -metrics
Efficient algorithms for the minimum diameter bridge problem
Introducing article numbering to Computational Geometry: Theory and Applications
Geometric TSP on sets
Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon
Sparse hop spanners for unit disk graphs
Rectilinear link diameter and radius in a rectilinear polygonal domain
Implementing straight skeletons with exact arithmetic: Challenges and experiences
Table cartogram
Bounds on the edge-length ratio of 2-outerplanar graphs
Graphs that admit right angle crossing drawings
Packing boundary-anchored rectangles and squares
Covering the plane by a sequence of circular disks with a constraint
Combinatorial Complexity of Signed Discs
On a problem about quadrant-depth
Euclidean position in Euclidean 2-orbifolds
Reprint of: Bounding the locus of the center of mass for a part with shape variation
Computing the geodesic centers of a polygonal domain
Grid representations and the chromatic number
Improved algorithms to network p-center location problems
Near-quadratic Bounds for the L1Voronoi Diagram of Moving Points
On minimum weight pseudo-triangulations
Snipperclips: Cutting tools into desired polygons using themselves
On the spanning and routing ratios of the directed Θ 6 -graph
Decomposing a simple polygon into pseudo-triangles and convex polygons
Special Issue on the 34th European Workshop on Computational Geometry, Guest Editors' Foreword
Single resolution compression of arbitrary triangular meshes with properties
Optimal slope selection via cuttings
New results on drawing angle graphs
On the union of k-curved objects
Optimal placement of convex polygons to maximize point containment
Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel
Monotone paths in line arrangements
Octrees with near optimal cost for ray-shooting
Clustering with faulty centers
A sufficient condition for the existence of plane spanning trees on geometric graphs
On R-trees with low query complexity
Fitting a two-joint orthogonal chain to a point set
The minimum-area spanning tree problem
Visibility with multiple diffuse reflections
Grid drawings of k -colourable graphs
Art gallery problem with guards whose range of vision is 180
A (5/3 + ε)-approximation for strip packing
γ -Soft packings of rectangles
Cylindrical static and kinetic binary space partitions
Rectangular partitions of a rectilinear polygon
Improved data structures for the orthogonal range successor problem
Chips on wafers, or packing rectangles into grids
A computational approach to Conway's thrackle conjecture
Checking geometric programs or verification of geometric structures
On a family of strong geometric spanners that admit local routing strategies
Minimum-link shortest paths for polygons amidst rectilinear obstacles
Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem
Rectangular drawings of plane graphs without designated corners
Advice complexity of online non-crossing matching
Folding polyiamonds into octahedra
Geometric dilation of closed planar curves: New lower bounds
On a Class of O(n2) Problems in Computational Geometry
Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time
Testing Geometric Objects
Covering points by disjoint boxes with outliers
Operations preserving the global rigidity of graphs and frameworks in the plane
Fréchet distance with speed limits
Geometric triangulations and discrete Laplacians on manifolds: An update
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
Turn-regularity and optimal area drawings of orthogonal representations
New pruning rules for the Steiner tree problem and 2-connected Steiner network problem
Visualizing geometric algorithms over the Web
The dual diameter of triangulations
Visibility preserving terrain simplification-- an experimental study
From virtual to physical reality with paper folding
Guest editorial: Special issue on the 25th Canadian Conference on Computational Geometry (CCCG)
Exact arithmetic at low cost - A case study in linear programming
The Expected Size of the Sphere-of-influence Graph
Area, perimeter and derivatives of a skin curve
Colored anchored visibility representations in 2D and 3D space
Assigning weights to minimize the covering radius in the plane
Editorial: EuroCG2015
Area-efficient algorithms for straight-line tree drawings
K-vertex guarding simple polygons
An algorithmic study of manufacturing paperclips and other folded structures
The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing
On the rectilinear crossing number of complete uniform hypergraphs
A decomposition-based approach to layered manufacturing
The snowblower problem
Some properties of k-Delaunay and k-Gabriel graphs
Conic nearest neighbor queries and approximate Voronoi diagrams
Rational tensegrities through the lens of toric geometry
On the minimum corridor connection problem and other generalized geometric problems
Conflict-Free Coloring of points on a line with respect to a set of intervals
Combinatorial complexity of translating a box in polyhedral 3-space
Linear complexity hexahedral mesh generation
Discrete rectilinear 2-center problems
An aperiodic tiles machine
Approximate distance oracles for graphs with dense clusters
Inscribed and circumscribed histogons of a convex polygon
Equitable subdivisions within polygonal regions
Optimal simplification of polygonal chains for subpixel-accurate rendering
Altitude terrain guarding and guarding uni-monotone polygons
Absolute approximation of Tukey depth: Theory and experiments
Guarding points on a terrain by watchtowers
Visibility representations of boxes in 2.5 dimensions
The power crust, unions of balls, and the medial axis transform
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Minimum cuts in geometric intersection graphs
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem
An algorithm for the construction of the tight span of finite subsets of the Manhattan plane
Testing Orthogonal Shapes
On the performance of the ICP algorithm
Offset polygon and annulus placement problems
Covering and piercing disks with two centers
Middle curves based on discrete Fréchet distance
Exact Minkowski sums of polygons with holes
Dynamic ham-sandwich cuts in the plane
Polygon exploration with time-discrete vision
Efficient approximation algorithms for clustering point-sets
Illumination in the presence of opaque line segments in the plane