Marching cubes is a computer graphics algorithm, published in the 1987 SIGGRAPH proceedings by Lorensen and Cline, [1] for extracting a polygonal mesh of an isosurface from a three-dimensional discrete scalar field (the elements of which are sometimes called voxels).

Abstract: We present XCube (abbreviated as X 3), a novel generative model for high-resolution sparse 3D voxel grids with arbitrary attributes. Our model can generate millions of voxels with a finest effective resolution of up to 1024 3 in a feed-forward fashion without time-consuming test-time optimization.

We present X3 (pronounced XCube), a novel generative model for high-resolution sparse 3D voxel grids with arbitrary attributes. Our model can generate millions of voxels with a finest effective resolution of up to 10243 in a feed-forward fashion without time …

Dec 6, 2023 · We present XCube (abbreviated as X3), a novel generative model for high-resolution sparse 3D voxel grids with arbitrary attributes. Our model can generate millions of voxels with a finest effective resolution of up to 10243 in a feed-forward fashion without time-consuming test-time optimization.

Aug 20, 2021 · Voxels are a way to define geometry with volume. A mesh is just a hull without anything inside. Sure, you could just render a thousand cube meshes but good luck with optimizing and greedy meshing that stuff. Raycasting is the easiest way to display a voxel. Rendering clouds, water or anything that is kinda transparent... voxels are king.

We present XCube (abbreviated as X3), a novel genera-tive model for high-resolution sparse 3D voxel grids with arbitrary attributes. Our model can generate millions of voxels with a finest effective resolution of up to 10243 in a feed-forward fashion without time …

We present XCube, a novel generative model for high-resolution sparse 3D voxel grids with arbitrary attributes. Our model can generate millions of voxels with a finest effective resolution of up to 1024^3 in a feed-forward fashion without time-consuming test-time optimization.

Feb 11, 2025 · Here, we proposed and tested a novel ground-filtering algorithm, a multi-size voxel cube (MSVC), utilizing a deep neural network.

Oct 9, 2019 · **EasyVoxels: Marching Cubes **provides a fast, multi-threaded and reliable way to generate Voxel Geometry using Dual Marching Cubes algorithm. About the algorithm : The marching cubes (MC) algorithm is a widely used technique for computing triangular mesh Iso Surfaces from discretely sampled volume data over rectilinear lattices.

Dec 3, 2024 · Here, we proposed and tested a novel ground-filtering algorithm utilizing a deep neural network. It is based on the voxelization of the cloud, classification of individual voxels as ground or non-ground, and gradual reduction of voxel size. Individual voxels are classified using surrounding voxels (a “voxel cube” of 9x9x9 voxels).