Back to Results
First PageMeta Content
Convex hull algorithms / Computational geometry / Delaunay triangulation / Triangulation / Sweep line algorithm / Algorithm / Quicksort / Floating point / CGAL / Mathematics / Geometry / Computing


CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing Stefan N¨ aher
Add to Reading List

Document Date: 2008-10-28 21:26:51

Open Document

File Size: 109,87 KB

Share Result on Facebook

City

Ottawa / San Diego / /

Company

Cambridge University Press / /

Country

Germany / /

/

Facility

LEDA library / University of Trier / /

IndustryTerm

geometric computing / linear search start / sweep algorithms / segment intersection algorithm / search trees / stores secondary search trees / sweep algorithm / priority-search trees / binary search / sweep line algorithm / plane sweep algorithms / search paths / search tree / secondary search trees / convex hull algorithms / binary search tree / balanced binary search trees / finger search / linear search / /

Organization

Cambridge University / University of Trier / /

Person

Stefan Funke / Martin Taphorn / Kurt Mehlhorn / Sartaj Sahni / Steven Fortune / Jacob E. Goodman / Grant Na / Dinesh P. Mehta / Christopher J. Van Wyk / /

/

ProvinceOrState

Ontario / /

PublishedMedium

Communications of the ACM / /

Technology

corresponding algorithm / sweep algorithm / segment intersection algorithm / 2.7 Line Segment Intersection The Bently-Ottmann sweep line algorithm / Incremental Convex Hull Algorithms / 1 Introduction Algorithms / sweep algorithms / points S. This algorithms / convex hull algorithms / flipping algorithm / plane sweep algorithms / presented algorithms / /

SocialTag