Skip to main content

Nonregular triangulations, view graphs of triangulations, and linear programming duality

  • Conference paper
  • First Online:
Book cover Discrete and Computational Geometry (JCDCG 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2098))

Included in the following conference series:

  • 561 Accesses

Abstract

For a triangulation and a point, we define a directed graph representing the order of the maximal dimensional simplices in the triangulation viewed from the point. We prove that triangulations having a cycle the reverse of which is not a cycle in this graph viewed from some point are forming a (proper) subclass of nonregular triangulations. We use linear programming duality to investigate further properties of nonregular triangulations in connection with this graph.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jesús A. de Loera, Serkan Hoşten, Francisco Santos, AND Bernd Sturmfels, The polytope of all triangulations of a point configuration, Doc. Math., 1 (1996) 103–119.

    MathSciNet  Google Scholar 

  2. Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag, Berlin, 1987.

    MATH  Google Scholar 

  3. Herbert Edelsbrunner, An acyclicity theorem for cell complexes in d dimension, Combinatorica, 10 (1990) 251–260.

    Article  MATH  MathSciNet  Google Scholar 

  4. Israel M. Gelfand, Mikhail M. Kapranov, AND Andrei V. Zelevinsky, Discriminants, resultants and multidimensional determinants, Birkhäuser, Boston, 1994.

    MATH  Google Scholar 

  5. Israel M. Gel’fand, Andrei V. Zelevinskii, AND Mikhail M. Kapranov, Newton polyhedra of principal A-determinants, Soviet Math. Dokl., 40 (1990) 278–281.

    MathSciNet  Google Scholar 

  6. Carl W. Lee, Regular triangulations of convex polytopes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4, Amer. Math. Soc., 1991, 443–456.

    Google Scholar 

  7. Hidefumi Ohsugi AND Takayuki Hibi, A normal (0; 1)-polytope none of whose regular triangulations is unimodular, Discrete Comput. Geom., 21 (1999) 201–204.

    Article  MATH  MathSciNet  Google Scholar 

  8. Francisco Santos, A point configuration whose space of triangulations is disconnected, J. Amer. Math. Soc., 13 (2000) 611–637.

    Article  MATH  MathSciNet  Google Scholar 

  9. Bernd Sturmfels, Gröbner bases of toric varieties, Tohoku Math. J., 43 (1991) 249–261.

    Article  MATH  MathSciNet  Google Scholar 

  10. Bernd Sturmfels, Gröbner bases and convex polytopes, American Mathematical Society, Providence, RI, 1996.

    MATH  Google Scholar 

  11. Günter M. Ziegler, Lectures on polytopes, Springer-Verlag, New York, 1995.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takeuchi, F. (2001). Nonregular triangulations, view graphs of triangulations, and linear programming duality. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 2000. Lecture Notes in Computer Science, vol 2098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47738-1_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-47738-1_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42306-5

  • Online ISBN: 978-3-540-47738-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics