Ponencia
New bound for incremental constructing arrangements of curves
Autor/es | Abellanas Oar, Manuel
Calatayud Ramos, Aymée García López, Jesús |
Fecha de publicación | 2004 |
Fecha de depósito | 2017-03-20 |
Publicado en |
|
Resumen | Let A(Γ) be the arrangement induced by a set Γ of n unbounded Jordan curves in the plane that intersect each other in at most two points. The upper bound for constructing those arrangements by an incremental method is, up ... Let A(Γ) be the arrangement induced by a set Γ of n unbounded Jordan curves in the plane that intersect each other in at most two points. The upper bound for constructing those arrangements by an incremental method is, up to now, O(nλ4(n)). In this paper we improve this bound to O(nλ3(n)). |
Identificador del proyecto | MCYT TIC2003-08933-C02-01
MCYT TIC2002-01541 |
Cita | Abellanas Oar, M., Calatayud Ramos, A. y García López, J. (2004). New bound for incremental constructing arrangements of curves. En 20th European Workshop on Computational Geometry, Sevilla. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
New bound for incremental ... | 105.6Kb | [PDF] | Ver/ | |