Geometric optimization
Conference
·
OSTI ID:10184644
An algorithm is presented which describes an application independent method for reducing the number of polygonal primitives required to faithfully represent an object. Reducing polygon count without a corresponding reduction in object detail is important for: achieving interactive frame rates in scientific visualization, reducing mass storage requirements, and facilitating the transmission of large, multi-timestep geometric data sets. This paper shows how coplanar and nearly coplanar polygons can be merged into larger complex polygons and re-triangulated into fewer simple polygons than originally required. The notable contributions of this paper are: (1) a method for quickly grouping polygons into nearly coplanar sets, (2) a fast approach for merging coplanar polygon sets and, (3) a simple, robust triangulation method for polygons created by 1 and 2. The central idea of the algorithm is the notion of treating polygonal data as a collection of segments and removing redundant segments to quickly form polygon hulls which represent the merged coplanar sets.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 10184644
- Report Number(s):
- LA-UR--93-3140; CONF-931080--4; ON: DE93040152
- Country of Publication:
- United States
- Language:
- English
Similar Records
A generic algorithm for constructing hierarchical representations of geometric objects
Fast geometric algorithms
Parallel solutions to geometric problems on the scan model of computation. Memorandum report
Conference
·
Sun Oct 01 00:00:00 EDT 1995
·
OSTI ID:202429
Fast geometric algorithms
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1983
·
OSTI ID:5343099
Parallel solutions to geometric problems on the scan model of computation. Memorandum report
Technical Report
·
Sun Jan 31 23:00:00 EST 1988
·
OSTI ID:6988480