Mar 02: Delaunay triangulation proofs

views comments

local Delaunay condition and Lawson's flip algorithm
paraboloid lifting map: locally Delaunay = locally convex lift
locally Delaunay everywhere = locally convex lift everywhere = convex lift = Delaunay
Flipping lowers the lifted surface, so Lawson's algorithm done after O(n^2) flips
Incremental flipping algorithm: also O(n^2) time in the worst case

	Contact Technology Services to report an issue, offer feedback, or request assistance.
	Technology Services Home \| Kaltura Help \| Privacy Policy
	Illinois Media Space, © 2022 Board of Trustees of the University of Illinois