Titlebook: Computational Geometry; XIV Spanish Meeting Alberto Márquez,Pedro Ramos,Jorge Urrutia Book 2012 Springer-Verlag Berlin Heidelberg 2012 com

Adornment

Stochastic Dominance and Diversification,Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert one into the other? This question has occupied researchers for over 75 years. We provide a comprehensive survey, including full proofs, of the various attempts to answer it.

青石板

Stochastic Dominance Option PricingThe twisted graph . is a complete topological graph with . vertices .,.,…,. in which two edges . (. < .) and . (. < .) cross each other if and only if . < . < . < . or . < . < . < .. We study several properties concerning plane topological subgraphs of ..

Condyle

https://doi.org/10.1007/978-3-642-95379-8We introduce a simple algorithm for constructing a spiral serpentine polygonization of a set . of . ≥ 3 points in the plane. Our algorithm simultaneously gives a triangulation of the constructed polygon at no extra cost, runs in .(. log.) time, and uses .(.) space.

护身符

Vadim S. Anishchenko,Alexander B. NeimanWe present a new method for unfolding a convex polyhedron into one piece without overlap, based on shortest paths to a convex curve on the polyhedron. Our “sun unfoldings” encompass source unfolding from a point, source unfolding from an open geodesic curve, and a variant of a recent method of Itoh, O’Rourke, and Vîlcu.

Epithelium

https://doi.org/10.1007/BFb0105592This paper describes algorithms for computing non-planar drawings of planar graphs in subquadratic area such that: (i) edge crossings are allowed only if they create large angles; (ii) the maximum number of bends per edge is bounded by a (small) constant.

强壮

高深莫测

Notes on the Twisted Graph,The twisted graph . is a complete topological graph with . vertices .,.,…,. in which two edges . (. < .) and . (. < .) cross each other if and only if . < . < . < . or . < . < . < .. We study several properties concerning plane topological subgraphs of ..

APRON

Spiral Serpentine Polygonization of a Planar Point Set,We introduce a simple algorithm for constructing a spiral serpentine polygonization of a set . of . ≥ 3 points in the plane. Our algorithm simultaneously gives a triangulation of the constructed polygon at no extra cost, runs in .(. log.) time, and uses .(.) space.

乳白光

Tonometry