The convex hull of freeform surfaces

Authors:
J.-K. Seong;G. Elber;J. K. Johnstone;M.-S. Kim
Affiliations:
School of Computer Science and Engineering, Seoul National, University, Seoul, Korea;Dept. of Computer Science, Technion, Israel Institute of Technology, Haifa, Israel;Dept. of Computer and Information Sciences, University of Alabama at Birmingham, Birmingham, AL;School of Computer Science and Engineering, Institute of Computer Technology, Seoul National University, Seoul, Korea
Venue:
Computing - Geometric modelling dagstuhl 2002
Year:
2004

Citing 10
Cited 8

Computational geometry: an introduction

Computational geometry: an introduction
Convex hulls of piecewise-smooth Jordan curves

Journal of Algorithms
Interpolation with developable Be´zier patches

Computer Aided Geometric Design
Second-order surface analysis using hybrid symbolic and numeric operators

ACM Transactions on Graphics (TOG)
An algorithm for planning collision-free paths among polyhedral obstacles

Communications of the ACM
Geometric constraint solver using multivariate rational spline functions

Proceedings of the sixth ACM symposium on Solid modeling and applications
The convex hull of ellipsoids

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
The convex Hull of Rational Plane Curves

Graphical Models
Computational Line Geometry

Computational Line Geometry
A Parametric Solution to Common Tangents

SMI '01 Proceedings of the International Conference on Shape Modeling & Applications

Giftwrapping a curve with the convex hull

ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
A higher dimensional formulation for robust and interactive distance queries

Proceedings of the 2006 ACM symposium on Solid and physical modeling
The visual hull of piecewise smooth objects

Computer Vision and Image Understanding
Voronoi diagram computations for planar NURBS curves

Proceedings of the 2008 ACM symposium on Solid and physical modeling
Trimming local and global self-intersections in offset curves/surfaces using distance maps

Computer-Aided Design
Short Communication to SMI 2011: Efficient convex hull computation for planar freeform curves

Computers and Graphics
Minimum area enclosure and alpha hull of a set of freeform planar closed curves

Computer-Aided Design
Technical note: Precise convex hull computation for freeform models using a hierarchical Gauss map and a Coons bounding volume hierarchy

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equations; using these zero-sets we characterize developable surface patches and planar patches that belong to the boundary of the convex hull.