Mostra el registre d'ítem simple
Maximizing maximal angles for plane straight-line graphs
dc.contributor.author | Aichholzer, Oswin |
dc.contributor.author | Hackl, Thomas |
dc.contributor.author | Hoffmann, Michael |
dc.contributor.author | Huemer, Clemens |
dc.contributor.author | Pór, Attila |
dc.contributor.author | Santos, Francisco |
dc.contributor.author | Speckmann, Bettina |
dc.contributor.author | Vogtenhuber, Birgit |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2012-09-25T10:39:59Z |
dc.date.created | 2013-01 |
dc.date.issued | 2013-01 |
dc.identifier.citation | Aichholzer, O. [et al.]. Maximizing maximal angles for plane straight-line graphs. "Computational geometry: theory and applications", Gener 2013, vol. 46, núm. 1, p. 17-28. |
dc.identifier.issn | 0925-7721 |
dc.identifier.uri | http://hdl.handle.net/2117/16559 |
dc.description.abstract | Let G=(S,E) be a plane straight-line graph on a finite point set S⊂R2 in general position. The incident angles of a point p∈S in G are the angles between any two edges of G that appear consecutively in the circular order of the edges incident to p. A plane straight-line graph is called φ-open if each vertex has an incident angle of size at least φ. In this paper we study the following type of question: What is the maximum angle φ such that for any finite set S⊂R2 of points in general position we can find a graph from a certain class of graphs on S that is φ-open? In particular, we consider the classes of triangulations, spanning trees, and spanning paths on S and give tight bounds in most cases. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Aeronàutica i espai |
dc.subject.lcsh | Geometry, Plane |
dc.subject.lcsh | Triangulation |
dc.title | Maximizing maximal angles for plane straight-line graphs |
dc.type | Article |
dc.subject.lemac | Triangulació |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.1016/j.comgeo.2012.03.002 |
dc.description.peerreviewed | Peer Reviewed |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 10872325 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Aichholzer, O.; Hackl, T.; Hoffmann, M.; Huemer, C.; Pór, A.; Santos, F.; Speckmann, B.; Vogtenhuber, B. |
local.citation.publicationName | Computational geometry: theory and applications |
local.citation.volume | 46 |
local.citation.number | 1 |
local.citation.startingPage | 17 |
local.citation.endingPage | 28 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.269]