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
Slice

heads
heads
kitten.nf20k.cut.m
kitten.nf20k.domain.m

Algorithm Description

The algorithm slice a mesh along a given curve or a graph, which consists of a set of sharp edges.

Input and output

  • The input is a mesh with sharp edge graph.
  • The output is the mesh cut along the graph.

Command

   slice.exe kitten.nf20k.cut.m kitten.nf20k.domain.m
   The output is
   kitten.nf20k.domain.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.