Arrangements

Efi Fogel (), Dan Halperin (), Lutz Kettner (), Monique Teillaud, Ron Wein () and Nicola Wolpert ()
Additional contact information
Efi Fogel: Tel Aviv University, School of Computer Science
Dan Halperin: Tel Aviv University, School of Computer Science
Lutz Kettner: Max-Planck-Institut für Informatik
Monique Teillaud: INRIA
Ron Wein: Tel Aviv University, School of Computer Science
Nicola Wolpert: Max-Planck-Institut für Informatik

Chapter 1 in Effective Computational Geometry for Curves and Surfaces, 2006, pp 1-66 from Springer

Keywords: Intersection Point; Query Point; Lower Envelope; Arrangement Package; Incremental Construction (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-33259-6_1

Ordering information: This item can be ordered from
http://www.springer.com/9783540332596

DOI: 10.1007/978-3-540-33259-6_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().