Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/237218.237429acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
Article
Free access

The power of coherence: fast tessellation of surfaces

Published: 01 May 1996 Publication History

Abstract

No abstract available.

References

[1]
B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485- 524, 1991.
[2]
J.H. Clark. A fast algorithm for rendering parametric surfaces. Proceedings of A CM Siggraph, pages 289-299, 1979.
[3]
K. Clarkson, R. E. Tarjan, and C. J. Van Wyk. A fast Las Vegas algorithm for triangulating a simple polygon. Discrete Comput. Geom., 4:423-432, 1989.
[4]
G. Farin. Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide. Academic Press Inc., 1993.
[5]
J. Kajiya. Ray tracing parametric patches. Computer Graphics, 16(3):245-254, 1982.
[6]
S. Kumar and D. Manocha. Interactive display of large scale trimmed NURBS models. Technical Report TR94-008, Department of Computer Science, University of North Carolina, 1994.
[7]
S. Kumar and D. Manocha. Efficient rendering of trimmed NURBS surfaces. Computer-Aided Design, 27(7):509-521, July 1995.
[8]
S. Kumar and D. Manocha. Dynamic mesh generation for parametric surfaces. In 5th international conference on Numerical Grid Generation in Computational Fluid Dynamics and Related Fields, Starkville, MS, 1996.
[9]
W.L. Luken and Fuhua Cheng. Rendering trimmed NURB surfaces. Computer science research report 18669(81711), IBM Research Division, 1993.
[10]
J.M. Lane, L.C. Carpenter, J. T. Whitted, and J.F. Blinn. Scan line methods for displaying parametrically defined surfaces. Communications of A CM, 23(1):23-34, 1980.
[11]
A. Rockwood, K. Heaton, and T. Davis. Realtime rendering of trimmed surfaces. In Proceedings of ACM Siggraph, pages 107-117, 1989.
[12]
R. Seidel. A simple and fast randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry Theory 84 Applications, 1(1):51-64, 1991.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SCG '96: Proceedings of the twelfth annual symposium on Computational geometry
May 1996
406 pages
ISBN:0897918045
DOI:10.1145/237218
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1996

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SoCG96
SoCG96: 12th ACM Symposium on Computational Geometry
May 24 - 26, 1996
Pennsylvania, Philadelphia, USA

Acceptance Rates

SCG '96 Paper Acceptance Rate 48 of 93 submissions, 52%;
Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 257
    Total Downloads
  • Downloads (Last 12 months)30
  • Downloads (Last 6 weeks)6
Reflects downloads up to 13 Sep 2024

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media