OpenAlex
PricingAboutJobs
Log inGet started
Work

Two algorithms for constructing a Delaunay triangulation

HTML

Year: 1980
Type: article
Source: International Journal of Parallel Programming
DOI: 10.1007/bf00977785
Authors: D. T. Lee, B. J. Schachter
Institutions: Northwestern University, General Electric (United States)
Language: English

Topic: Computational Geometry and Mesh Generation
Subfield: Computer Graphics and Computer-Aided Design
Field: Computer Science
Domain: Physical Sciences
Keywords: Delaunay triangulation, triangulation algorithms, divide-and-conquer, planar point sets, computational geometry, average-case performance, asymptotically optimal algorithms

Open Access status: closed
OpenAlex ID: W2002827932
FWCI: 4.991
Cites: 31
Cited by: 1,853
Related to: 9
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