Delaunay triangulation programs on surface data.
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Choi, Sunghee | - |
| dc.contributor.author | Amenta, Nina | - |
| dc.date.accessioned | 2011-02-14T01:30:59Z | - |
| dc.date.available | 2011-02-14T01:30:59Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2002-01-01 | - |
| dc.identifier.citation | SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms , v., no., pp.135 - 136 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/22086 | - |
| dc.description.abstract | The Delaunay triangulation of a set of points in 3D can have size Θ(n2) in the worst case, but this is rarely if ever observed in practice. We compare three production-quality Delaunay triangulation programs on some 'real-world' sets of points lying on or near 2D surfaces. | - |
| dc.description.sponsorship | We are very grateful to Clarkson for hull, to Shewchuk for a pre-release copy of pyramid, and to Teillaud and Pion for a pre-release version of CGM. Delaunay hierarchy. | en |
| dc.language | ENG | - |
| dc.language.iso | en_US | en |
| dc.title | Delaunay triangulation programs on surface data. | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.citation.beginningpage | 135 | - |
| dc.citation.endingpage | 136 | - |
| dc.citation.publicationname | SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms | - |
| dc.contributor.localauthor | Choi, Sunghee | - |
| dc.contributor.nonIdAuthor | Amenta, Nina | - |
- Appears in Collection
- CS-Conference Papers(학술회의논문)
- Files in This Item
- CA02.pdf(167.31 kB)Download
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.