Proceedings: GI 1996

Algebraic loop detection and evaluation algorithms for curve and surface interrogations

Shankar Krishnan, Dinesh Manocha

Proceedings of Graphics Interface '96: Toronto, Ontario, Canada, 22 - 24 May 1996, 87-94

DOI 10.20380/GI1996.11

  • BibTeX

    @inproceedings{KrishnanManocha-gi96,
     title = {Algebraic loop detection and evaluation algorithms for curve and surface interrogations},
     author = {Shankar Krishnan and Dinesh Manocha},
     booktitle = {Proceedings of the Graphics Interface 1996 Conference, May 22-24, 1996, Toronto, Ontario, Canada},
     year = {1996},
     month = {May},
     isbn = {0-9695338-5-3},
     publisher = {Canadian Human-Computer Communications Society},
     url = {http://graphicsinterface.org/wp-content/uploads/gi1996-11.pdf},
     pages = {87--94}
    }
    

Abstract

Evaluating curves on surfaces is a frequently occurring operation in a number of applications involving surface interrogations. For example, evaluating the intersection curve of two surfaces is critical to boundary (B-rep) computation, and in applications involving visibility and rendering, the ability to evaluate the silhouette curve of surfaces is important. While dealing with high degree surfaces, these curves usually consist of a number of components, including loops. We present a new algebraic loop characterization algorithm that can be applied in a number of applications. In particular, we discuss its application to the intersection curve of two surfaces and the silhouette curve of a surface. Unlike some other loop detection algorithms, our method can be applied even when the curve contain(s) singularities.