Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

COMGEO
2004
ACM

favoriteEmaildiscussreport

88views Applied Computing» more COMGEO 2004»

Convexity minimizes pseudo-triangulations

13 years 4 months ago

Convexity minimizes pseudo-triangulations

Download www.win.tue.nl

The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasse

Real-time Traffic

Applied Computing | COMGEO 2004 | Convex Position | Minimum Pseudo-triangulations | Point Sets |

claim paper

Related Content

» Minimal Inequalities for an Infinite Relaxation of Integer Programs

» Minimal Simplicial Dissections and Triangulations of Convex 3Polytopes

» A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems

» On representations of the feasible set in convex optimization

» Classification Methods with Reject Option Based on Convex Risk Minimization

» On the Strong Convergence of Gradients in Stabilized Degenerate Convex Minimization Proble...

» LargeScale Convex Minimization with a LowRank Constraint

» Convergence rate analysis of an asynchronous space decomposition method for convex Minimiz...

» Minimizing the total variation under a general convex constraint for image restoration

» Minimizing Convex Functions with Bounded Perturbations

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMGEO
Authors	Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann

Comments (0)