Computational Geometry XIV 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 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Márquez, Alberto (Επιμελητής έκδοσης), Ramos, Pedro (Επιμελητής έκδοσης), Urrutia, Jorge (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
• Σειρά: Lecture Notes in Computer Science, 7579
• Θέματα: Computer science.; Computer communication systems.; Data structures (Computer science).; Computers.; Algorithms.; Computer science > Mathematics.; Computer graphics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Computer Graphics.; Data Structures.; Computation by Abstract Devices.; Computer Communication Networks.

This 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 pla...

Πίνακας περιεχομένων:

• On 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.