Many graphics and computer-aided design applications require that the polygonal meshes used in geometric computing have the properties of not only 2-manifold but also are orientable. By collecting previous work scattered in the topology and geometry literature, we rigorously present a theoretical basis for orientable polygonal surface representation from a modern point of view. Based on the presented basis, we propose a new combinatorial data structure that can guarantee the property of orientable 2-manifolds and is primal/dual efficient. Comparisons with other widely used data structures are also presented in terms of time and space efficiency
Generating surfaces from spatial curves with topology constraints is a fundamental task in computer ...
Different geometric structures are investigated in the context of discrete surface representation. I...
A point P 2 Rn is represented in Parallel Coordinates by a polygonal line ¯ P (see [Ins99] for a rec...
Design solutions for a program library are presented for combinatorial data structures in computatio...
Design solutions for a program library are presented for combinatorial data structures in computatio...
A closed orientable surface of genus g can be obtained by appropriate identification of pairs of edg...
Abstract. In algebraic topology, compact 2-dimensional manifolds are usually dealt through a well-de...
International audienceThis work is part of a PhD thesis about polyhedral mesh generation for simulat...
Any Piecewise-Linear (PL) surface can be formed from a regular polygon (including the interior) with...
Multiresolution representations are becoming more and more important for the visualization, operatio...
There is nowadays an increasing need in interaction between discrete surfaces (2-manifolds) and imag...
Most deformable surfaces used in computer vision are restricted to a simple underlying mesh topology...
This thesis describes an algorithm for calculating the theoretic set operations union, intersection,...
We present a unifying framework to represent all topologically distinct shapes in 3D, from solids to...
AbstractWe provide a complete list of 59 orientable neighborly 2-manifolds with 12 vertices of genus...
Generating surfaces from spatial curves with topology constraints is a fundamental task in computer ...
Different geometric structures are investigated in the context of discrete surface representation. I...
A point P 2 Rn is represented in Parallel Coordinates by a polygonal line ¯ P (see [Ins99] for a rec...
Design solutions for a program library are presented for combinatorial data structures in computatio...
Design solutions for a program library are presented for combinatorial data structures in computatio...
A closed orientable surface of genus g can be obtained by appropriate identification of pairs of edg...
Abstract. In algebraic topology, compact 2-dimensional manifolds are usually dealt through a well-de...
International audienceThis work is part of a PhD thesis about polyhedral mesh generation for simulat...
Any Piecewise-Linear (PL) surface can be formed from a regular polygon (including the interior) with...
Multiresolution representations are becoming more and more important for the visualization, operatio...
There is nowadays an increasing need in interaction between discrete surfaces (2-manifolds) and imag...
Most deformable surfaces used in computer vision are restricted to a simple underlying mesh topology...
This thesis describes an algorithm for calculating the theoretic set operations union, intersection,...
We present a unifying framework to represent all topologically distinct shapes in 3D, from solids to...
AbstractWe provide a complete list of 59 orientable neighborly 2-manifolds with 12 vertices of genus...
Generating surfaces from spatial curves with topology constraints is a fundamental task in computer ...
Different geometric structures are investigated in the context of discrete surface representation. I...
A point P 2 Rn is represented in Parallel Coordinates by a polygonal line ¯ P (see [Ins99] for a rec...