OpenAlex
PricingAboutJobs
Log inGet started
Work

Topologically sweeping an arrangement

HTML

Year: 1986
Type: conference-paper
Source: ACM Symposium on Theory of Computing (STOC)
DOI: 10.1145/12130.12171
Authors: H Edelsbrunner, L J Guibas
Institutions: University of Illinois Urbana-Champaign, Stanford University
Language: English

Topic: Computational Geometry and Mesh Generation
Subfield: Computer Graphics and Computer-Aided Design
Field: Computer Science
Domain: Physical Sciences
Keywords: line arrangements, planar arrangements, amortized complexity, visibility problems, convex polytopes, computational geometry algorithms

Open Access status: closed
OpenAlex ID: W2038730428
FWCI: 8.199
Cites: 26
Cited by: 301
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms