Sciweavers

11 search results - page 1 / 3
» BSP-Assisted Constrained Tetrahedralization
Sort
View
CG
2005
Springer
13 years 10 months ago
An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization
An unstructured tetrahedral mesh generation algorithm for 3D model with constraints is presented. To automatically generate a tetrahedral mesh for model with constraints, an advan...
Yi-Jun Yang, Jun-Hai Yong, Jia-Guang Sun
CCCG
2003
14 years 8 days ago
The Strange Complexity of Constrained Delaunay Triangulation
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
Nicolas Grislain, Jonathan Richard Shewchuk
CGF
2008
141views more  CGF 2008»
13 years 10 months ago
Accelerating Ray Tracing using Constrained Tetrahedralizations
In this paper we introduce the constrained tetrahedralization as a new acceleration structure for ray tracing. A constrained tetrahedralization of a scene is a tetrahedralization ...
Ares Lagae, Philip Dutré
IMR
2003
Springer
14 years 4 months ago
BSP-Assisted Constrained Tetrahedralization
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...
Bhautik Joshi, Sébastien Ourselin
GISCIENCE
2008
Springer
115views GIS» more  GISCIENCE 2008»
13 years 12 months ago
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
Abstract. Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersectin...
Edward Verbree, Hang Si