Abstract
A new approach to simplify orthogonal pseudo-polyhedra (OPP) and binary volumes is presented. The method is incremental and produces a level-of-detail (LOD) sequence of OPP. Any object of this sequence contains the previous objects and, therefore, it is a bounding orthogonal approximation of them. The sequence finishes with the minimum axis-aligned bounding box (AABB). OPP are represented by the Extreme Vertices Model, a complete model that stores a subset of their vertices and performs fast Boolean operations. Simplification is achieved using a new approach called merging faces, which relies on the application of 2D Boolean operations. We also present a technique, based on the model continuity, for a better shape preservation. The method has been tested with several datasets and compared with two similar methods.
| Original language | English |
|---|---|
| Title of host publication | Discrete Geometry for Computer Imagery - 17th IAPR International Conference, DGCI 2013, Proceedings |
| Pages | 143-154 |
| Number of pages | 12 |
| ISBN (Electronic) | 9783642370663 |
| DOIs | |
| Publication status | Published - 5 Apr 2013 |
| Externally published | Yes |
| Event | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - Duration: 25 Jul 2011 → … |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 7749 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Period | 25/7/11 → … |
Bibliographical note
Copyright:Copyright 2021 Elsevier B.V., All rights reserved.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)