### 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 language | English (US) |
---|---|

Pages | 163-169 |

Number of pages | 7 |

State | Published - Dec 1 1985 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.*. 163-169.

**EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.** / ElGindy, Hossam A.; Toussaint, Godfried.

Research output: Contribution to conference › Paper

}

TY - CONF

T1 - EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.

AU - ElGindy, Hossam A.

AU - Toussaint, Godfried

PY - 1985/12/1

Y1 - 1985/12/1

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=0022279266&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022279266&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0022279266

SP - 163

EP - 169

ER -