EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.

Hossam A. ElGindy, Godfried T. Toussaint

Research output: Contribution to conferencePaperpeer-review

Abstract

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 languageEnglish (US)
Pages163-169
Number of pages7
StatePublished - 1985

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.'. Together they form a unique fingerprint.

Cite this