MathGroup Archive 2006

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: DelaunayTriangulation and Quadrangulation

  • To: mathgroup at
  • Subject: [mg65079] Re: DelaunayTriangulation and Quadrangulation
  • From: "Jens-Peer Kuska" <kuska at>
  • Date: Tue, 14 Mar 2006 05:59:56 -0500 (EST)
  • Organization: Uni Leipzig
  • References: <durker$lqr$>
  • Sender: owner-wri-mathgroup at


there is no algorithm that "quadrangulates" a 
given 2d set of points,
because it would be hard to "quadrangulates" five 
points ...

You can try to glue adjacent triangles along the 
longest common edge
but it would be complicated


"Borut Levart" <BoLe79 at> schrieb im 
Newsbeitrag news:durker$lqr$1 at
| First I apologize for this post is not 
completely Mathematica-related,
| but I am positive some of you might really help 
| DelaunayTriangulation under Mathematica 
triangulates a 2d set of
| points. The output triangles are nearest to 
being equilateral.
| Instead of triangular elements I would like to 
work with the
| quadrangular. How can I achieve that?
| a) Should I partition the triangular mesh, and 
join the triangles two
| by two?
| b) Or perhaps an algorithm analogous to Delaunay 
exists that
| "quadrangulates" a given 2d set of points?
| Many thanks for any positive direction,
| Borut Levart
| Slovenia

  • Prev by Date: Re: Importing Several sheets from one Excel file into Mathematica
  • Next by Date: Re: Plot resolution
  • Previous by thread: DelaunayTriangulation and Quadrangulation
  • Next by thread: Problems with graphic output under linux