Publication Type |
Journal Article |
School or College |
College of Engineering |
Department |
Computing, School of |
Creator |
Bruderlin, Beat |
Title |
Robust regularized set operations on polyhedra |
Date |
1990 |
Description |
This paper describes a provably correct and robust implementation of regularized set operations on polyhedral objects. Although the algorithm described here does not assume manifold polyhedra and handles all possible degenerate cases, it turns out to be quite simple. The geometric operations and relations are computed with floating point arithmetic which is efficient but not necessarily precise. To ensure that the results are still consistent we implemented a test that detects when dependent decisions contradict each other. The consistency test is relatively simple and can be carried out locally without having to reason about the logical dependencies of the geometric relations. The logical structure and the efficiency of the algorithm are barely influenced by the consistency test which makes this approach well suited for interactive modeling systems on modern workstations. |
Type |
Text |
Publisher |
University of Utah |
First Page |
1 |
Last Page |
28 |
Subject |
Robust regularized set operations |
Subject LCSH |
Polyhedra |
Language |
eng |
Bibliographic Citation |
Bruderlin, B. (1990). Robust regularized set operations on polyhedra. 1-28. UUCS-90-004. |
Series |
University of Utah Computer Science Technical Report |
Relation is Part of |
ARPANET |
Rights Management |
©University of Utah |
Format Medium |
application/pdf |
Format Extent |
9,588,577 bytes |
Identifier |
ir-main,16347 |
ARK |
ark:/87278/s6kw60qf |
Setname |
ir_uspace |
ID |
707227 |
Reference URL |
https://collections.lib.utah.edu/ark:/87278/s6kw60qf |