Researchain
Decentralized Journals
A
Archives
Welcome to Researchain!
Feedback Center
Decentralized Journals
A
Archives
Updated
Computer Science
Computational Geometry
Computational Geometry Column 43
Joseph O'Rourke
Abstract
The concept of pointed pseudo-triangulations is defined and a few of its applications described.
Full PDF
Related Researches
Bounded-Degree Spanners in the Presence of Polygonal Obstacles
by
André van Renssen
Drawing outer-1-planar graphs revisited
by
Therese Biedl
Steady and ranging sets in graph persistence
by
Mattia G. Bergomi
2D Fractional Cascading on Axis-aligned Planar Subdivisions
by
Peyman Afshani
Consistent High Dimensional Rounding with Side Information
by
Orr Dunkelman
A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee
by
Hengzhao Ma
Persistent Homology in ℓ ∞ Metric
by
Gabriele Beltramo
An Evolver program for weighted Steiner trees
by
Henrique Botelho
Expected Size of Random Tukey Layers and Convex Layers
by
Zhengyang Guo
GPLAN: Computer-Generated Dimensioned Floorplans for given Adjacencies
by
Krishnendra Shekhawat
On Polyhedral Realization with Isosceles Triangles
by
David Eppstein
Finding Closed Quasigeodesics on Convex Polyhedra
by
Erik D. Demaine
A Topological Similarity Measure between Multi-Field Data using Multi-Resolution Reeb Spaces
by
Tripti Agarwal
Simple Topological Drawings of k -Planar Graphs
by
Michael Hoffmann
Flip Paths Between Lattice Triangulations
by
William Sims
On the Maximum Number of Crossings in Star-Simple Drawings of K n with No Empty Lens
by
Stefan Felsner
Limiting crossing numbers for geodesic drawings on the sphere
by
Marthe Bonamy
Polygons with Prescribed Angles in 2D and 3D
by
Alon Efrat
(2+ε) -ANN for time series under the Fréchet distance
by
Anne Driemel
On Turn-Regular Orthogonal Representations
by
Michael A. Bekos
Plane Spanning Trees in Edge-Colored Simple Drawings of K n
by
Oswin Aichholzer
Quality tetrahedral mesh generation with HXT
by
Célestin Marot
Parameterized Algorithms for Queue Layouts
by
Sujoy Bhore
Planar L-Drawings of Bimodal Graphs
by
Patrizio Angelini
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
by
Karl Bringmann
«
1
2
3
4
»
Submitted on 6 Mar 2002
Updated
arXiv.org
Original Source
NASA ADS
Google Scholar
Semantic Scholar