Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
CVGIP: Graphical Models and Image Processing
Matchmaker: manifold BReps for non-manifold r-sets
Proceedings of the fifth ACM symposium on Solid modeling and applications
Connected morphological operators for binary images
Computer Vision and Image Understanding
Exploring unknown environments with obstacles
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Visualization and Computer Graphics
Orthogonal Polyhedra: Representation and Computation
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Interactive Point-Based Isosurface Extraction
VIS '04 Proceedings of the conference on Visualization '04
Efficient representation and extraction of 2-manifold isosurfaces using kd-trees
Graphical Models - Special issue on pacific graphics 2003
IEEE Transactions on Visualization and Computer Graphics
Topological model for 3D image representation: Definition and incremental extraction algorithm
Computer Vision and Image Understanding
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Edge Transformations for Improving Mesh Quality of Marching Cubes
IEEE Transactions on Visualization and Computer Graphics
Reconstructing Polygons from Scanner Data
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Reconstructing orthogonal polyhedra from putative vertex sets
Computational Geometry: Theory and Applications
Merging faces: a new orthogonal simplification of solid models
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Skeletal representations of orthogonal shapes
Graphical Models
| Hi-index | 0.00 |
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 O(nlogn) 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.