Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A survey of the marching cubes algorithm
A survey of the development of the marching cubes algorithm [W. Lorensen, H. Cline,
Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics …
Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics …
[PDF][PDF] Efficiently using graphics hardware in volume rendering applications
OpenGL and its extensions provide access to advanced per-pixel operations available in the
rasterization stage and in the frame buffer hardware of modern graphics workstations. With …
rasterization stage and in the frame buffer hardware of modern graphics workstations. With …
A near optimal isosurface extraction algorithm using the span space
Presents the" Near Optimal IsoSurface Extraction"(NOISE) algorithm for rapidly extracting
isosurfaces from structured and unstructured grids. Using the span space, a new …
isosurfaces from structured and unstructured grids. Using the span space, a new …
Speeding up isosurface extraction using interval trees
The interval tree is an optimally efficient search structure proposed by Edelsbrunner (1980)
to retrieve intervals on the real line that contain a given query value. We propose the …
to retrieve intervals on the real line that contain a given query value. We propose the …
Fast isocontouring for improved interactivity
We present an isocontouring algorithm which is near-optimal for real-time interaction and
modification of isovalues in large datasets. A preprocessing step selects a subset S of the …
modification of isovalues in large datasets. A preprocessing step selects a subset S of the …
Isosurfacing in span space with utmost efficiency (ISSUE)
We present efficient sequential and parallel algorithms for isosurface extraction. Based on
the Span Space data representation, new data subdivision and searching methods are …
the Span Space data representation, new data subdivision and searching methods are …
[PDF][PDF] Real-time exploration of regular volume data by adaptive reconstruction of isosurfaces
We propose an adaptive approach for the fast reconstruction of isosurfaces from regular
volume data at arbitrary levels of detail. The algorithm has been designed to enable real …
volume data at arbitrary levels of detail. The algorithm has been designed to enable real …
Hardware-accelerated volume and isosurface rendering based on cell-projection
S Rottger, M Kraus, T Ertl - Proceedings Visualization 2000. VIS …, 2000 - ieeexplore.ieee.org
We present two beneficial rendering extensions to the projected tetrahedra (PT) algorithm
proposed by Shirley and Tuchman (1990). These extensions are compatible with any cell …
proposed by Shirley and Tuchman (1990). These extensions are compatible with any cell …
[BOK][B] Isosurfaces: geometry, topology, and algorithms
R Wenger - 2013 - books.google.com
This work represents the first book to focus on basic algorithms for isosurface construction. It
also gives a rigorous mathematical perspective on some of the algorithms and results. In …
also gives a rigorous mathematical perspective on some of the algorithms and results. In …
History of the marching cubes algorithm
WE Lorensen - IEEE computer graphics and applications, 2020 - ieeexplore.ieee.org
The Marching Cubes paper by Bill Lorensen and Harvey Cline,“Marching Cubes: A High
Resolution 3D Surface Construction Algorithm,” was published at SIGGRAPH 1987.1 …
Resolution 3D Surface Construction Algorithm,” was published at SIGGRAPH 1987.1 …