The.Algorithm.Design.Manual.Springer-Verlag.1998
Share Embed Flag
Download ePaper

The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998

omarfabiano
18.04.2013 Views

Triangle: A Two-Dimensional Quality Mesh Generator Triangle: A Two-Dimensional Quality Mesh Generator Triangle, by Jonathan Shewchuk of Carnegie-Mellon University, is a C language code which generates Delaunay triangulations, constrained Delaunay triangulations (forced to have certain edges), and quality conforming Delaunay triangulations (which avoid small angles by inserting extra points). It has been widely used for finite element analysis and other applications, and is fast and robust. Triangle would be the first thing I would try if I was looking for two-dimensional triangulation code. Although Triangle is available at http://www.cs.cmu.edu/~quake/triangle.html, it is copyrighted by the author and may not be sold or included in commercial products without a license. Also included is a package by Shewchuk for robust computation of geometric predicates using exact arithmetic. ● Triangle home page ● Netlib source directory ● Robust Geometric Primatives ● Download Files (local site) Problem Links ● Triangulation (9) About the Book Send us Mail Go to Main Page This page last modified on Sep 26, 1996. file:///E|/WEBSITE/IMPLEMEN/TRIANGLE/IMPLEMEN.HTM [19/1/2003 1:40:48]

Arrange - maintainance of arrangements with point location Arrange - maintainance of arrangements with point location Arrange is a package written in C by Michael Goldwasser of Stanford University for maintaining arrangements of polygons in either the plane or on the sphere. Polygons may be degenerate, and hence represent arrangements of lines. A randomized incremental construction algorithm is used, and efficient point location on the arrangement supported. Polygons may be inserted but not deleted from the arrangement, and arrangements of several thousand vertices and edges can be constructed in a few seconds. Arrange is available from ftp://flamingo.stanford.edu/pub/wass/arrangement. ● Arrange ftp source directory ● Michael Goldwasser's home page ● Download Files (local site) Problem Links ● Maintaining Line Arrangements (9) ● Point Location (6) About the Book Send us Mail Go to Main Page This page last modified on Apr 24, 1996. file:///E|/WEBSITE/IMPLEMEN/ARRANGE/IMPLEMEN.HTM [19/1/2003 1:40:48]

Arrange - maintainance of arrangements with point location<br />

Arrange - maintainance of arrangements with point<br />

location<br />

Arrange is a package written in C by Michael Goldwasser of Stanford University for maintaining<br />

arrangements of polygons in either the plane or on the sphere. Polygons may be degenerate, and hence<br />

represent arrangements of lines. A randomized incremental construction algorithm is used, and efficient<br />

point location on the arrangement supported. Polygons may be inserted but not deleted from the<br />

arrangement, and arrangements of several thousand vertices and edges can be constructed in a few<br />

seconds. Arrange is available from ftp://flamingo.stanford.edu/pub/wass/arrangement.<br />

● Arrange ftp source directory<br />

● Michael Goldwasser's home page<br />

● Download Files (local site)<br />

Problem Links<br />

● Maintaining Line Arrangements (9)<br />

● Point Location (6)<br />

About the Book<br />

Send us Mail<br />

Go to Main Page<br />

This page last modified on Apr 24, 1996.<br />

file:///E|/WEBSITE/IMPLEMEN/ARRANGE/IMPLEMEN.HTM [19/1/2003 1:40:48]

logo

products

Resources

Company

Terms of service
Privacy policy
Cookie policy
Cookie settings
Imprint
Change language
Made with love in Switzerland
© 2024 Yumpu.com all rights reserved

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!