Australian Computer Journal
Voronoi diagrams and arrangements
Discrete & Computational Geometry
Connect-the-dots: a new heuristic
Computer Vision, Graphics, and Image Processing
Shape reconstruction from planar cross sections
Computer Vision, Graphics, and Image Processing
The implementation of an algorithm to find the convex hull of a set of three-dimensional points
ACM Transactions on Graphics (TOG)
Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computational geometry in C
A Simple Method for Resolving Degeneracies in Delaunay Triangulations
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Interpolating an unorganized 2D point cloud with a single closed shape
Computer-Aided Design
| Hi-index | 0.00 |
A key problem in Computer Aided Design, Finite Element mesh generation and manufacturing is to construct a surface which passes through a given set of points in R3, and which might satisfy other properties. The points could result from measurements taken from a model of a car boat body or a person's skull. In this paper, implementations of algorithms due to Fortune and O'Rourke which solve the corresponding problem for simple curves enclosing simply-connected regions in R2 using the Voronoi Diagram, are described. These concepts and ideas are extended to R3.