Abstract
Given a set of n labeled points on S d , how many combinatorially different geometric triangulations for this point set are there? We show that the logarithm of this number is at most some positive constant times n ⌊ d/2⌋+1 . Evidence is provided that for even dimensions d the bound can be improved to some constant times n d/2 .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
