Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Constrained paths in the flip-graph of regular triangulations
 
research article

Constrained paths in the flip-graph of regular triangulations

Pournin, Lionel  
•
Liebling, Thomas M.  
2007
Computational geometry

We describe particular paths in the flip-graph of regular triangulations in any dimension. It is shown that any pair of regular triangulations is connected by a path along which none of their common faces are destroyed. As a consequence, we obtain the connectivity of the flip-graph of regular triangulations that share the same vertex set.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

PouLie Constrained paths in the flip-graph.pdf

Access type

openaccess

Size

136.02 KB

Format

Adobe PDF

Checksum (MD5)

cf62997f3954b45489199f205cdfe187

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés