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 / [electronic resource] :
edited by Alberto Márquez, Pedro Ramos, Jorge Urrutia.
- 1st ed. 2012.
- X, 283 p. 176 illus. online resource.
- Theoretical Computer Science and General Issues, 7579 2512-2029 ; .
- Theoretical Computer Science and General Issues, 7579 .
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 ofColored 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 PlaneLattice.
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 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.
9783642341915
10.1007/978-3-642-34191-5 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Computer graphics.
Artificial intelligence--Data processing.
Computer science.
Computer networks .
Algorithms.
Discrete Mathematics in Computer Science.
Computer Graphics.
Data Science.
Theory of Computation.
Computer Communication Networks.
QA76.9.A43
518.1
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 ofColored 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 PlaneLattice.
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 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.
9783642341915
10.1007/978-3-642-34191-5 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Computer graphics.
Artificial intelligence--Data processing.
Computer science.
Computer networks .
Algorithms.
Discrete Mathematics in Computer Science.
Computer Graphics.
Data Science.
Theory of Computation.
Computer Communication Networks.
QA76.9.A43
518.1