ADAPTIVE POLYGONIZATION OF IMPLICIT SURFACES USING SIMPLICIAL DECOMPOSITION AND BOUNDARY CONSTRAINTS

Simple item page
dc.contributor.authorVelho, Luizen_US
dc.date.accessioned2015-10-05T07:56:30Z
dc.date.available2015-10-05T07:56:30Z
dc.date.issued1990en_US
dc.description.abstractThis paper presents a method to generate a polygonal approximation of implicit surfaces. Space partitioning by simplicial decomposition is used to sample the surface, which provides an unambiguous framework for polygon creation. Simplices are adaptively subdivided in order to faithfully represent the surface with a minimum number of elements. The space subdivision is done recursively, without the need of additional data structures to keep track of the process, which usually results in large memory requirements. Furthermore, boundary constraints are imposed on the surface tesselation to overcome the problem of discontinuities usually associated with adaptive methods.en_US
dc.description.seriesinformationEG 1990-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19901010en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19901010en_US
dc.publisherEurographics Associationen_US
dc.titleADAPTIVE POLYGONIZATION OF IMPLICIT SURFACES USING SIMPLICIAL DECOMPOSITION AND BOUNDARY CONSTRAINTSen_US
Files
Collections
EG1990 Proceedings (Technical Papers)
EG1990 Proceedings (Technical Papers)