Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » geometry.research.independent

Topic: REV: A speedier way to decompose polygons
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
Kathie Barnes

Posts: 21
Registered: 12/3/04
REV: A speedier way to decompose polygons
Posted: Sep 10, 1992 10:30 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Cipra, Barry, A speedier way to decompose polygons, Science 253 (19 July
1991) 270.

Decomposing polygons is a "key procedure in computational geometry," for
such purposes as the finite-element method and the painting of surfaces
in CAD/CAM solid-modeling systems. Bernard Chazelle (Princeton
University) has devised an O (N) algorithm for the problem, besting O
(N*N) for naive algorithms and the previous record of O (N log N).

This review was reprinted with permission from Mathematics Magazine,
December 1991 issue.





Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.