<--- Back to Details
First PageDocument Content
Manifolds / Topological graph theory / Triangulation / Euler characteristic / 4-manifold / Topological manifold / Piecewise linear manifold / Topology / Geometric topology / Algebraic topology
Date: 2013-05-16 04:21:32
Manifolds
Topological graph theory
Triangulation
Euler characteristic
4-manifold
Topological manifold
Piecewise linear manifold
Topology
Geometric topology
Algebraic topology

Add to Reading List

Source URL: www.hpc.cineca.it

Download Document from Source Website

File Size: 519,48 KB

Share Document on Facebook

Similar Documents

Triangulation Numbers Caspar and Klug found that only some arrangements of subunits can form quasisymmetrical capsids. To explain this, they developed the concept

Triangulation Numbers Caspar and Klug found that only some arrangements of subunits can form quasisymmetrical capsids. To explain this, they developed the concept

DocID: 1vdSu - View Document

CONSTRUCTING REGULAR TRIANGULATION VIA LOCAL TRANSFORMATIONS: THEORETICAL AND PRACTICAL ADVANCES MINGCEN GAO

CONSTRUCTING REGULAR TRIANGULATION VIA LOCAL TRANSFORMATIONS: THEORETICAL AND PRACTICAL ADVANCES MINGCEN GAO

DocID: 1tLli - View Document

AN O(n2 log n) TIME ALGORITHM FOR THE MINMAX ANGLE TRIANGULATION HERBERT EDELSBRUNNERy , TIOW SENG TANy AND ROMAN WAUPOTITSCHy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the m

AN O(n2 log n) TIME ALGORITHM FOR THE MINMAX ANGLE TRIANGULATION HERBERT EDELSBRUNNERy , TIOW SENG TANy AND ROMAN WAUPOTITSCHy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the m

DocID: 1tKLY - View Document

Edge Insertion for Optimal Triangulations1 M. Bern2 , H. Edelsbrunner3 , D. Eppstein4 , S. Mitchell5 and T. S. Tan3 Abstract The edge-insertion paradigm improves a triangulation of a nite point set in <2 iteratively by

Edge Insertion for Optimal Triangulations1 M. Bern2 , H. Edelsbrunner3 , D. Eppstein4 , S. Mitchell5 and T. S. Tan3 Abstract The edge-insertion paradigm improves a triangulation of a nite point set in <2 iteratively by

DocID: 1tKcZ - View Document

A QUADRATIC TIME ALGORITHM FOR THE MINMAX LENGTH TRIANGULATION HERBERT EDELSBRUNNER AND TIOW SENG TANy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the maximum edge length can b

A QUADRATIC TIME ALGORITHM FOR THE MINMAX LENGTH TRIANGULATION HERBERT EDELSBRUNNER AND TIOW SENG TANy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the maximum edge length can b

DocID: 1tH3b - View Document