Quadrilateral Meshing by Circle Packing

Details Quadrilateral Meshing by Circle Packing Quadrilateral Meshing by Circle Packing

1999-08-19

arxiv.org/abs/cs/9908016v1

Int. J. Comp. Geom. & Appl. 10(4):347-360, Aug. 2000

Computer Science

Computational Geometry

12 pages, 10 figures. To appear in Int. J. Comp. Geom. & Appl. A preliminary version of this work was presented at the 6th Int

Scientific paper

We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these methods can generate meshes of several types: (1) the elements form the cells of a Voronoi diagram, (2) all elements have two opposite right angles, (3) all elements are kites, or (4) all angles are at most 120 degrees. In each case the total number of elements is O(n), where n is the number of input vertices.

Affiliated with

Also associated with

No associations

Rating

Quadrilateral Meshing by Circle Packing 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 Quadrilateral Meshing by Circle Packing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quadrilateral Meshing by Circle Packing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-48119