Union and Split Operations on Dynamic Trapezoidal Maps - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1995

Union and Split Operations on Dynamic Trapezoidal Maps

Monique Teillaud

Abstract

We propose here algorithms to perform two new operations on an arrangement of line segments in the plane, represented by a trapezoidal map: the split of the map along a given vertical line $D$, and the union of two trapezoidal maps computed in two vertical slabs of the plane that are adjacent through a vertical line $D$. The data structure is a modified Influence graph, still allowing dynamic insertions and deletions of line segments in themap. The algorithms for both operations run in $O(s_D \log n +\log^2 n)$ time, where $n$ is the number of line segments in the map, and $s_D$ is the number of line segments intersected by $D$.
Fichier principal
Vignette du fichier
RR-2486.pdf (252.77 Ko) Télécharger le fichier

Dates and versions

inria-00074189 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074189 , version 1

Cite

Monique Teillaud. Union and Split Operations on Dynamic Trapezoidal Maps. RR-2486, INRIA. 1995. ⟨inria-00074189⟩
109 View
153 Download

Share

Gmail Facebook X LinkedIn More