|
ABSTRACT
An algorithm for drawing pictures of three-dimensional objects, with surfaces made up of patches of quadric surfaces, is described. The emphasis of this algorithm is on calculating the intersections of quadric surfaces. A parameterization scheme is used. Each quadric surface intersection curve (QSIC) is represented as a set of coefficients and parameter limits. Each value of the parameter represents at most two points, and these may easily be distinguished. This scheme can find the coordinates of points of even quartic (fourth-order) intersection curves, using equations of no more than second order. Methods of parameterization for each type of QSIC are discussed, as well as surface bounding and hidden surface removal.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
 |
2
|
|
| |
3
|
Dresden, A. Solid Analytical Geometry and Determinants. Dover, New York, 1964.
|
| |
4
|
Levin, J.Z. A parametric algorithm for drawing pictures of solid objects bounded by quadric surfaces. Tech. Rep. CRL-46, School of Eng., Rensselaer Polytechnic Inst., Troy, N.Y., 1976.
|
| |
5
|
Loutrel, P. A solution to the hidden-line problem for computer-drawn polyhedra. IEEE Trans. Computers C-19, 3 (March 1970), 205-213.
|
| |
6
|
Mahl, R. Visible surface algorithm for quadric patches. IEEE Trans. Computers C-21, (Jan. 1972), 1-4.
|
| |
7
|
Metelli, F. The perception of transparency. Scientific American 230, 4 (April 1974), 90-98.
|
| |
8
|
|
 |
9
|
|
 |
10
|
|
| |
11
|
Woon, P.Y. A computer procedure for generating visible-line drawings of solids bounded by quadric surfaces. Tech. Rep. 403-15, Dep. Electr. Eng., School of Eng. and Sci., New York U., New York, Nov. 1970.
|
| |
12
|
Woon, P.Y., and Freeman, H. A procedure for generating visible-line projections of solids bounded by quadric surfaces. Information Processing 71, Vol. 2, North-Holland Pub. Co., Amsterdam, 1971, pp. 1120-1125.
|
CITED BY 31
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Laurent Dupont , Daniel Lazard , Sylvain Lazard , Sylvain Petitjean, Near-optimal parameterization of the intersection of quadrics, Proceedings of the nineteenth annual symposium on Computational geometry, June 08-10, 2003, San Diego, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Eric Berberich , Michael Hemmer , Lutz Kettner , Elmar Schömer , Nicola Wolpert, An exact, complete and efficient implementation for computing planar maps of quadric intersection curves, Proceedings of the twenty-first annual symposium on Computational geometry, June 06-08, 2005, Pisa, Italy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Pradeep Sinha , Eric Klassen , K. K. Wang, Exploiting topological and geometric properties for selective subdivision, Proceedings of the first annual symposium on Computational geometry, p.39-45, June 05-07, 1985, Baltimore, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|