#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2005

2017

- This year (3)
- Last 5 years (10)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hang Si, Klaus GÃ¤rtner
- IMR
- 2005

We present a method to decompose an arbitrary 3D piecewise linear complex (PLC) into a constrained Delaunay tetrahedralization (CDT). It successfully resolves the problem of non-existence of a CDT byâ€¦ (More)

- Hang Si
- ACM Trans. Math. Softw.
- 2015

TetGen is a C++ program for generating good quality tetrahedral meshes aimed to support numerical methods and scientific computing. The problem of quality tetrahedral mesh generation isâ€¦ (More)

- Hang Si
- IMR
- 2006

This paper discusses the problem of refining constrained Delaunay tetrahedralizations (CDTs) into good quality meshes suitable for adaptive numerical simulations. A practical algorithm which extendsâ€¦ (More)

- Hang Si
- IMR
- 2009

Shewchukâ€™s Delaunay refinement algorithm is a simple scheme to efficiently tetrahedralize a 3D domain. The original analysis provided guarantees on termination and output edge lengths. However, theâ€¦ (More)

- Franco Dassi, Andrea Mola, Hang Si
- Engineering with Computers
- 2017

A common representation of surfaces with complicated topology and geometry is through composite parametric surfaces. This is the case for most CAD modelers. The majority of these models focus onâ€¦ (More)

Many applications heavily rely on piecewise triangular meshes to describe complex surface geometries. High-quality meshes significantly improve numerical simulations. In practice, however, one oftenâ€¦ (More)

- Hang Si
- 2008

Many physical phenomena can be modeled by partial differential equations which may be solved by numerical methods such as finite element and finite volume methods. In this context, a given domainâ€¦ (More)

- Edward Verbree, Hang Si
- GIScience
- 2008

Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersecting polygons or open gaps toâ€¦ (More)

- Nadja Goerigk, Hang Si
- 2015

The existence of indecomposable polyhedra, that is, the interior of every such polyhedron cannot be decomposed into a set of tetrahedra whose vertices are all of the given polyhedron, is well-known.â€¦ (More)

- Jianjun Chen, Jianjing Zheng, Yao Zheng, Zhoufang Xiao, Hang Si, Yufeng Yao
- Engineering with Computers
- 2016

Existing flips for tetrahedral meshes simply make a selection from a few possible configurations within a single shell (i.e., a polyhedron that can be filled up with a mesh composed of a set ofâ€¦ (More)