EFFICIENT ALGORITHMS FOR INSERTING AND DELETING EDGES FROM TRIANGULATIONS.

Hossam A. ElGindy, Godfried Toussaint

Research output: Contribution to conferencePaper

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 - Dec 1 1985

Fingerprint

Triangulation

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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

1985. 163-169.

Research output: Contribution to conferencePaper

@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 Godfried Toussaint",
year = "1985",
month = "12",
day = "1",
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

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 -