Computational Geometry [E-Book] : 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 / edited by Alberto Márquez, Pedro Ramos, Jorge Urrutia.
Márquez, Alberto.
Ramos, Pedro. / Urrutia, Jorge.
Berlin, Heidelberg : Springer Berlin Heidelberg : 2012
Imprint: Springer,
X, 283 p. 176 illus. digital.
englisch
9783642341915
10.1007/978-3-642-34191-5
Lecture notes in computer science ; 7579
Full Text
Table of Contents:
  • 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.