We address the problem of edge-updating a triangulation of a point set efficiently. Given a suitable representation of the triangulation of a finite set P, how can one construct a triangulation of P union left brace 1 right brace for some line segment 1 (insertion problem), or how can one construct a triangulation of P - left brace p,q right brace where p and q are points in P that are connected by an edge in the triangulation (deletion problem).
|Original language||English (US)|
|Number of pages||7|
|State||Published - 1985|
ASJC Scopus subject areas