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
Type
research article
DOI
10.1016/j.comgeo.2006.07.001
Web of Science ID

WOS:000245758900005

Author(s)
Pournin, Lionel  
Liebling, Thomas M.  
Date Issued

2007

Published in
Computational geometry
Volume

37

Issue

2

Start page

134

End page

140

Subjects

Regular triangulations

•

Flip-graph

•

Secondary polytope

•

Secondary fan

Note

PRO 060706

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
ROSO  
Available on Infoscience
December 15, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/238569
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