Incremental constructions con BRIO
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Amenta, Nina | - |
| dc.contributor.author | Choi, Sunghee | - |
| dc.contributor.author | Rote, Günter | - |
| dc.date.accessioned | 2011-02-14 | - |
| dc.date.available | 2011-02-14 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2003-06-01 | - |
| dc.identifier.citation | SCG '03 Proceedings of the nineteenth annual symposium on Computational geometry, v., no., pp.211 - 219 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/22080 | - |
| dc.description.abstract | Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define a biased randomized insertion order which removes enough randomness to significantly improve performance, but leaves enough randomness so that the algorithms remain theoretically optimal. | - |
| dc.language | ENG | - |
| dc.language.iso | en_US | en |
| dc.title | Incremental constructions con BRIO | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.citation.beginningpage | 211 | - |
| dc.citation.endingpage | 219 | - |
| dc.citation.publicationname | SCG '03 Proceedings of the nineteenth annual symposium on Computational geometry | - |
| dc.contributor.localauthor | Choi, Sunghee | - |
| dc.contributor.nonIdAuthor | Amenta, Nina | - |
| dc.contributor.nonIdAuthor | Rote, Günter | - |
- Appears in Collection
- CS-Conference Papers(학술회의논문)
- Files in This Item
- 10.1.1.1.5683.pdf(450.61 kB)Download
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.