Counting Triangulations and Other Crossing-free Structures Approximately

Alvarez, Victor; Bringmann, Karl; Ray, Saurabh; Seidel, Raimund

doi:10.1016/j.comgeo.2014.12.006

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2388260_3

DetailsSummary

Released

Journal Article

Counting Triangulations and Other Crossing-free Structures Approximately

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45269

Ray, Saurabh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Alvarez, V., Bringmann, K., Ray, S., & Seidel, R. (2015). Counting Triangulations and Other Crossing-free Structures Approximately. Computational Geometry: Theory and Applications, 48(5), 386-397. doi:10.1016/j.comgeo.2014.12.006.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-53D7-B

Abstract

There is no abstract available