Sciweavers

SODA
2004
ACM
80views Algorithms» more  SODA 2004»
14 years 24 days ago
Output-sensitive construction of the union of triangles
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
Eti Ezra, Micha Sharir