论文信息 - Lodestar: an octree-based level of detail generator for VRML

Lodestar: an octree-based level of detail generator for VRML

Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do not deal with the special requirements of input data in VRML format. We report an algorithm called LODESTAR, based on octree quantization that robustly computes simplifications for objects in VRML.

Dieter Schmalstieg | D. Schmalstieg

[1] James H. Clark,et al. Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[2] Michael Gervautz,et al. A simple method for color quantization: octree quantization , 1990 .

[3] William E. Lorensen,et al. Decimation of triangle meshes , 1992, SIGGRAPH.

[4] Greg Turk,et al. Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[5] Jarek Rossignac,et al. Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.

[6] Tony DeRose,et al. Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

[7] W. Stürzlinger,et al. Generating Multiple Levels of Detail from Polygonal Geometry Models , 1995, Virtual Environments.

[8] J. L. Pajon,et al. Building and exploiting levels of detail: an overview and some VRML experiments , 1995, VRML '95.

[9] D. Manocha,et al. Fast Polygon Triangulation Based on Seidel's Algorithm , 1995 .

[10] Dieter Schmalstieg,et al. Demand‐Driven Geometry Transmission for Distributed Virtual Environments , 1996, Comput. Graph. Forum.

[11] James H. Clark. Hierarchical geometric models for visible surface algorithms , 1998 .