Linear Complexity Hexahedral Mesh Generation

Details Linear Complexity Hexahedral Mesh Generation Linear Complexity Hexahedral Mesh Generation

1998-09-26

arxiv.org/abs/cs/9809109v1

Comp. Geom. Theory & Appl. 12 (1999) 3-16

Computer Science

Computational Geometry

12 pages, 17 figures. A preliminary version of this paper appeared at the 12th ACM Symp. on Computational Geometry. This is th

Scientific paper

10.1016/S0925-7721(98)00032-7

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an additional bipartiteness condition. The same techniques can also be used to reduce the geometric version of the hexahedral mesh generation problem to a finite case analysis amenable to machine solution.

Affiliated with

Also associated with

No associations

Rating

Linear Complexity Hexahedral Mesh Generation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear Complexity Hexahedral Mesh Generation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Complexity Hexahedral Mesh Generation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307293