11. History dags, point location, and fast triangulation

From Jeff Erickson 3/4/2021

views comments

a. History dag description
b. Space analysis: O(n) expected
c. Query time analysis: O(log n) expected
d. Polygon triangulation: locating vertices by scanning
e. Seidel's triangulation algorithm: O(n log* n) expected time

Tags: computational geometry

Looking for more...

	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

11. History dags, point location, and fast triangulation

Related Media