000 05822nam a22005775i 4500
001 978-3-642-34191-5
003 DE-He213
005 20140220083329.0
007 cr nn 008mamaa
008 121116s2012 gw | s |||| 0|eng d
020 _a9783642341915
_9978-3-642-34191-5
024 7 _a10.1007/978-3-642-34191-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aMárquez, Alberto.
_eeditor.
245 1 0 _aComputational Geometry
_h[electronic resource] :
_bXIV 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 /
_cedited by Alberto Márquez, Pedro Ramos, Jorge Urrutia.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aX, 283 p. 176 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7579
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Graphics.
650 2 4 _aData Structures.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aComputer Communication Networks.
700 1 _aRamos, Pedro.
_eeditor.
700 1 _aUrrutia, Jorge.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642341908
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7579
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-34191-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c103746
_d103746