Back to Results
First PageMeta Content
Computational geometry / Discrete geometry / Euclidean plane geometry / Convex geometry / Arrangement of lines / Convex hull / Vertex / Convex set / Bentley–Ottmann algorithm / Geometry / Mathematics / Convex analysis


CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Capturing crossings: Convex hulls of segment and plane intersections Esther M. Arkin AMS SUNY Stony Brook
Add to Reading List

Document Date: 2008-10-28 21:27:23

Open Document

File Size: 210,04 KB

Share Result on Facebook

City

Berlin / Ottawa / Baltimore / /

Country

Germany / /

IndustryTerm

plane using existing machinery / sweep algorithm / basic tool / equivalent algorithm / /

Organization

Johns Hopkins Univ. / National Aeronautics and Space Administration / SUNY / National Science Foundation / /

Person

Micha Sharir / Marc van Kreveld / Jack Snoeyink / Mark de Berg / Joseph S. B. Mitchell / Mark Overmars / Luc Devroye / Esther M. Arkin / Stefan Langerman / Mordecai Golin / H. Edelsbrunner / Leonidas J. Guibas / Godfried Toussaint / William Steiger / Subhash Suri / Otfried Schwarzkopf / /

ProvinceOrState

Maryland / Ontario / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

J. Algorithms / classic Bentley-Ottmann sweep algorithm / equivalent algorithm / /

SocialTag