EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.

Hossam A. ElGindy; Godfried T. Toussaint

EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.

Hossam A. ElGindy, Godfried T. Toussaint

Computer Science

Research output: Contribution to conference › Paper › peer-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 language	English (US)
Pages	163-169
Number of pages	7
State	Published - 1985

ASJC Scopus subject areas

General Engineering

Cite this

@conference{cd2358d695b64284a48c78165e2b2bdf,

title = "EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.",

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).",

author = "ElGindy, {Hossam A.} and Toussaint, {Godfried T.}",

year = "1985",

language = "English (US)",

pages = "163--169",

}

TY - CONF

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

AU - ElGindy, Hossam A.

AU - Toussaint, Godfried T.

PY - 1985

Y1 - 1985

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 -

EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this