Get Free Shipping on orders over $79
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 - Alberto Márquez

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

By: Alberto Márquez (Editor), Pedro Ramos (Editor), Jorge Urrutia (Editor)

Paperback | 16 November 2012

At a Glance

Paperback


$129.75

or 4 interest-free payments of $32.44 with

 or 

Ships in 10 to 15 business days

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.

More in Algorithms & Data Structures

Python for Algorithmic Trading : From Idea to Cloud Deployment - Yves Hilpisch
Learning Algorithms : A Programmer's Guide to Writing Better Code - George Heineman
Python Using GPT-5 and Gemini - Oswald Campesato
Finite Element Mesh Generation, 2e - Daniel S.H.  Lo
Fundamentals of Data Structures and Algorithms - Elvis C. Foster

RRP $158.00

$121.75

23%
OFF
Hacker's Delight - Henry Warren

RRP $97.60

$76.75

21%
OFF
Quick Data Structures : Quick Programming - David Matuszek
Ciphers, Fractals, and Fibonacci : Exploring Math with Python - John Lehet