Learn More
An algorithm for the polygonization of implicit surfaces is described and an implementation in C is provided. The discussion reviews implicit surface polygonization, and compares various methods. Introduction Some shapes are more readily defined by implicit, rather than parametric, techniques. For example, consider a sphere centered at C with radius r. It(More)
A method is presented for representing botanical trees, given three-dimensional points and connections. Limbs are modeled as generalized cylinders whose axes are space curves that interpolate the points. A free-form surface connects branching limbs. "Blobby" techniques are used to model the tree trunk as a series of non-circular cross sections. Bark is(More)
The authors review the principal algorithms for the polygonization of implicit surfaces and provide a framework for identifying their conceptual similarities and practical differences. The algorithms' merits are evaluated according to topological disambiguation, implementation complexity, and triangle count. Special attention is devoted to the ambiguity(More)
Smoothly blended articulated models are often difficult to construct using current techniques. Our solution in this paper is to extend the surfaces introduced by Blinn [Blinn 1982] by using three-dimensional convolution with skeletons composed of polygons or curves. The resulting convolution surfaces permit fluid topology changes, seamless part joins, and(More)