Computational Conformal Geometry Library - CCGL
CCGL logo

Introduction

Getting CCGL
    Download
    Installation

Development Guide
    Architecture
    Performance

Gallery
    Snapshots
    Movies
Mesh Data Structure
    Viewer
Topology
    Cut Graph
    Slicer
    Double Cover
    Homology Basis
Conformal Maps
    Harmonic Map
    Spherical Harmonic Map
    LSCM
Holomorphic 1-Form
    Integration
    Harmonic 1-Form
    Holomorphic 1-Form
    Slit Map
Curvature Flow
    Euclidean Ricci Flow
    Poly Annulus Ricci Flow
    Hyperbolic Ricci Flow
    Yamabe Flow
Documentation
    Reference Book
Acknowledgements
Cut Graph

heads
heads
heads
a. Input mesh
b. Cut graph
c. Cut graph

Algorithm Description

The algorithm computes the cut graph of a closed mesh.

Input and output

  • The input is closed mesh.
  • The output is the cut graph of the mesh.

Command

   cutgraph.exe kitten.nf20k.m kitten.nf20k.cut.m

Computational Stability

   The computation is purely combinatorial, it is very stable.

Example

   The input mesh has 20k faces. The computational time is less than 1 seconds on a PC with 3.0 GB of RAM, 3.60 GHz CPU. The data set and the source can be downloaded.