VRONI: an engineering approach to the reliable and efficient computation of voronoi diagrams of points and line segments

PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets

ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation

Polygon Partition into Stable Regions

Proceedings of the 24th DAGM Symposium on Pattern Recognition

On the computation of 3d periodic triangulations

Proceedings of the twenty-fourth annual symposium on Computational geometry

Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments

Computer-Aided Design

Medial axis computation for planar free-form shapes

Computer-Aided Design

Divide-and-conquer for Voronoi diagrams revisited

Proceedings of the twenty-fifth annual symposium on Computational geometry

A smooth spiral tool path for high speed machining of 2D pockets

Computer-Aided Design

An Ontology for Grounding Vague Geographic Terms

Proceedings of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008)

Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses

2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling

Surface reconstruction by moving contours

CGIM '07 Proceedings of the Ninth IASTED International Conference on Computer Graphics and Imaging

Provably good 2D shape reconstruction from unorganized cross-sections

SGP '08 Proceedings of the Symposium on Geometry Processing

Applying spatial reasoning to topographical data with a grounded geographical ontology

GeoS'07 Proceedings of the 2nd international conference on GeoSpatial semantics

Divide-and-conquer for Voronoi diagrams revisited

Computational Geometry: Theory and Applications

Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice

Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space

Transactions on computational science IX

Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space

Transactions on computational science IX

Quality mesh smoothing via local surface fitting and optimum projection

Graphical Models

Motorcycle graphs: Stochastic properties motivate an efficient yet simple implementation

Journal of Experimental Algorithmics (JEA)

Computing medial axes of generic 3D regions bounded by B-spline surfaces

Computer-Aided Design

Regularized tessellation density estimation with bootstrap aggregation and complexity penalization

Pattern Recognition

Reliable and efficient computational geometry via controlled perturbation

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Modelling and animating hand wrinkles

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

A vector-based algorithm to generate and update multiplicatively weighted Voronoi diagrams for points, polylines, and polygons

Computers & Geosciences

Centroidal Voronoi Tessellation of Line Segments and Graphs

Computer Graphics Forum

Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses

Computer Aided Geometric Design