Computer Graphics Forum · 1996 · 295 citations · 0 references
ArchitectureComputer ScienceComputer GraphicsComputer VisionRendering3D RenderingGeometric ApproximationGeometry ProcessingImage-based RenderingLevel Of DetailLevel Of Detail ModelingMesh ApproximationObjectsShapeShape ApproximationTriangulation Algorithms
The algorithm targets rendering complex scenes with many objects at varying levels of detail, using a region‑merging approach similar to image segmentation. The study proposes an algorithm to automatically compute multi‑level approximations of a polyhedral object. The algorithm iteratively collapses edges guided by a geometric deviation metric from the original shape. When edges are merged in the correct order, the method yields a continuum of valid approximations that enable faster rendering across a wide range of scales.
Abstract We propose a new algorithm for automatically computing approximations of a given polyhedral object at different levels of details. The application for this algorithm is the display of very complex scenes. where many objects are seen with a range of varying levels of detail. Our approach is similar to the region‐merging method used for image segmentation. We iteratively collapse edges, based on a measure of the geometric deviation from the initial shape. When edges are merged in the right order, this strategy produces a continuum of valid approximations of the original object, which can be used for faster rendering at vastly different scales.