LEADER 06732nam 22008775 450 001 996466312303316 005 20230329234543.0 010 $a3-642-34191-8 024 7 $a10.1007/978-3-642-34191-5 035 $a(CKB)3400000000102798 035 $a(SSID)ssj0000810192 035 $a(PQKBManifestationID)11468808 035 $a(PQKBTitleCode)TC0000810192 035 $a(PQKBWorkID)10833637 035 $a(PQKB)10882271 035 $a(DE-He213)978-3-642-34191-5 035 $a(MiAaPQ)EBC6287546 035 $a(MiAaPQ)EBC5595758 035 $a(Au-PeEL)EBL5595758 035 $a(OCoLC)1076240354 035 $a(PPN)168326361 035 $a(EXLCZ)993400000000102798 100 $a20121116d2012 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputational Geometry$b[electronic resource] $eXIV Spanish Meeting on Computational Geometry, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcalá de Henares, Spain, June 27-30, 2011, Revised Selected Papers /$fedited by Alberto Márquez, Pedro Ramos, Jorge Urrutia 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (X, 283 p. 176 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7579 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-34190-X 327 $aOn 5-Gons and 5-Holes.- On Reversibility among Parallelohedra -- A History of Flips in Combinatorial Triangulations.- Open Guard Edges and Edge Guards in Simple Polygons -- String-Wrapped Rotating Disks -- The Chromatic Number of the Convex Segment Disjointness Graph -- Continuous Flattening of Convex Polyhedra -- Convexifying Monotone Polygons while Maintaining Internal Visibility -- On the Number of Radial Orderings of Colored Planar Point Sets -- Notes on the Twisted Graph.-Locating a Service Facility and a Rapid Transit Line -- Simultaneously Flippable Edges in Triangulations.- Spiral Serpentine Polygonization of a Planar Point Set -- The 1-Center and 1-Highway Problem -- Compact Grid Representation of Graphs -- On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets -- A Generalization of the Source Unfolding of Convex Polyhedra -- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area -- Connecting Red Cells in a Bicolour Voronoi Diagram -- Covering Islands in Plane Point Sets -- Rectilinear Convex Hull with Minimum Area -- Separated Matchings and Small Discrepancy Colorings -- A Note on the Number of Empty Triangles -- Meshes Preserving Minimum Feature Size -- Geometric Graphs in the Plane Lattice. On Reversibility among Parallelohedra -- A History of Flips in Combinatorial Triangulations.- Open Guard Edges and Edge Guards in Simple Polygons -- String-Wrapped Rotating Disks -- The Chromatic Number of the Convex Segment Disjointness Graph -- Continuous Flattening of Convex Polyhedra -- Convexifying Monotone Polygons while Maintaining Internal Visibility -- On the Number of Radial Orderings of Colored Planar Point Sets -- Notes on the Twisted Graph.-Locating a Service Facility and a Rapid Transit Line -- Simultaneously Flippable Edges in Triangulations.- Spiral Serpentine Polygonization of a Planar Point Set -- The 1-Center and 1-Highway Problem -- Compact Grid Representation of Graphs -- On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets -- A Generalization of the Source Unfolding of Convex Polyhedra -- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area -- Connecting Red Cells in a Bicolour Voronoi Diagram -- Covering Islands in Plane Point Sets -- Rectilinear Convex Hull with Minimum Area -- Separated Matchings and Small Discrepancy Colorings -- A Note on the Number of Empty Triangles -- Meshes Preserving Minimum Feature Size -- Geometric Graphs in the Plane Lattice. 330 $aThis Festschrift volume is published in honor of Ferran Hurtado on the occasion of his 60th birthday; it contains extended versions of selected communications presented at the XIV Spanish Meeting on Computational Geometry, held at the University of Alcalá, Spain, in June 2011. Ferran Hurtado has played a central role in the Spanish community of Computational Geometry since its very beginning, and the quantity and quality of the international participants in the conference is an indisputable proof of his relevance in the international level. The 26 revised full papers were carefully reviewed and selected from numerous submissions. The papers present original research in computational geometry, in its broadest sense. Topics included are discrete and combinatorial geometry, linear programming applied to geometric problems, geometric algorithms and data structures, theoretical foundations of computational geometry, questions of interest in the implementation of geometric algorithms, and applications of computational geometry. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7579 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aArtificial intelligence?Data processing 606 $aComputer science 606 $aComputer networks 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 606 $aData Science 606 $aTheory of Computation 606 $aComputer Communication Networks 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science. 615 0$aComputer networks. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aData Science. 615 24$aTheory of Computation. 615 24$aComputer Communication Networks. 676 $a516.00285 702 $aMárquez$b Alberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRamos$b Pedro$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aUrrutia$b Jorge$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aEuropean Grid Conference 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466312303316 996 $aComputational geometry$91899245 997 $aUNISA