Efficient algorithms for boundary extraction of 2D and 3D orthogonal pseudomanifolds
View/Open
1-s2.0-S1524070312000112-main.pdf (1,185Mb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/15727
Document typeArticle
Defense date2012
Rights accessRestricted access - publisher's policy
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
In this paper we present algorithms to extract the boundary representation of orthogonal polygons and polyhedra, either manifold or pseudomanifold. The algorithms we develop reconstruct not only the polygons of the boundaries but also the hole-face inclusion relationship. Our algorithms have a simple input so they can be used to convert many different kinds of models to B-Rep. In the 2D case, the input is the set of vertices, and in the 3D case, some small additional information must be supplied for every vertex. All proposed algorithms run in View the MathML source time and use O(n) space, where n is the number of vertices of the input. Moreover, we explain how to use our proposal to extract the boundary from the well-known voxel and octree models as well as from three vertex-based models found in the related literature: the neighbourhood, the EVM, and the weighted vertex list models.
CitationVigo, M. [et al.]. Efficient algorithms for boundary extraction of 2D and 3D orthogonal pseudomanifolds. "Graphical models", 2012, vol. 74, núm. 3, p. 61-74.
ISSN1524-0703
Publisher versionhttp://www.sciencedirect.com/science/article/pii/S1524070312000112
Files | Description | Size | Format | View |
---|---|---|---|---|
1-s2.0-S1524070312000112-main.pdf![]() | 1,185Mb | Restricted access |