Results 1  10
of
622
Marching cubes: A high resolution 3D surface construction algorithm
 COMPUTER GRAPHICS
, 1987
"... We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divideandconquer approach to generate interslice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical d ..."
Abstract

Cited by 2696 (4 self)
 Add to MetaCart
We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divideandconquer approach to generate interslice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 298 (24 self)
 Add to MetaCart
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled
Mesh Optimization
, 1993
"... We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy f ..."
Abstract

Cited by 392 (8 self)
 Add to MetaCart
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy
Geometric Compression through Topological Surgery
 ACM TRANSACTIONS ON GRAPHICS
, 1998
"... ... this article introduces a new compressed representation for complex triangulated models and simple, yet efficient, compression and decompression algorithms. In this scheme, vertex positions are quantized within the desired accuracy, a vertex spanning tree is used to predict the position of each ..."
Abstract

Cited by 283 (28 self)
 Add to MetaCart
vertex from 2, 3, or 4 of its ancestors in the tree, and the correction vectors are entropy encoded. Properties, such as normals, colors, and texture coordinates, are compressed in a similar manner. The connectivity is encoded with no loss of information to an average of less than two bits per triangle
THE TRIANGLE OF OPERATORS, TOPOLOGIES, BORNOLOGIES
, 2005
"... In memory of my teacher YauChuen Wong (1935.10.2–1994.11.7) Abstract. This paper discusses two common techniques in functional analysis: the topological method and the bornological method. In terms of Pietsch’s operator ideals, we establish the equivalence of the notions of operators, topologies an ..."
Abstract
 Add to MetaCart
In memory of my teacher YauChuen Wong (1935.10.2–1994.11.7) Abstract. This paper discusses two common techniques in functional analysis: the topological method and the bornological method. In terms of Pietsch’s operator ideals, we establish the equivalence of the notions of operators, topologies
Holomorphic triangle invariants and the topology of symplectic fourmanifolds
 Duke Math. J
"... This article analyzes the interplay between symplectic geometry in dimension 4 and the invariants for smooth fourmanifolds constructed using holomorphic triangles introduced in [20]. Specifically, we establish a nonvanishing result for the invariants of symplectic fourmanifolds, which leads to new ..."
Abstract

Cited by 46 (5 self)
 Add to MetaCart
This article analyzes the interplay between symplectic geometry in dimension 4 and the invariants for smooth fourmanifolds constructed using holomorphic triangles introduced in [20]. Specifically, we establish a nonvanishing result for the invariants of symplectic fourmanifolds, which leads
Lossless Topological Subdivision of Triangle Meshes
, 1999
"... In this paper, we investigate subdivision tree representations of arbitrary triangle meshes. By subdivision, we mean the recursive topological partitioning of a triangle into subtriangles. Such a process can be represented by a subdivision tree. We identify the class of regular triangle meshes, t ..."
Abstract
 Add to MetaCart
In this paper, we investigate subdivision tree representations of arbitrary triangle meshes. By subdivision, we mean the recursive topological partitioning of a triangle into subtriangles. Such a process can be represented by a subdivision tree. We identify the class of regular triangle meshes
For Which Triangles is . . .
, 2009
"... We present an intriguing question about lattice points in triangles where Pick’s formula is “almost correct”. The question has its origin in knot theory, but its statement is purely combinatorial. After more than 30 years the topological question was recently solved, but the lattice point problem i ..."
Abstract
 Add to MetaCart
We present an intriguing question about lattice points in triangles where Pick’s formula is “almost correct”. The question has its origin in knot theory, but its statement is purely combinatorial. After more than 30 years the topological question was recently solved, but the lattice point problem
Equipartitioning triangles
"... An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for any positive integer n, K can be expressed as the union of n convex sets with disjoint interiors and each having the same area and perimeter. The first difficult case n = 3 was settled by Bárány, Bl ..."
Abstract
 Add to MetaCart
, Blagojevi¢, and Szucs using powerful tools from algebra and equivariant topology. Here we give an elementary proof of this result in case K is a triangle.
Results 1  10
of
622