Abstract
An acute triangulation of a polygon Γ is a triangulation of Γ into acute triangles. Let f(Γ) denote the minimum number of triangles necessary for an acute triangulation of Γ. We prove that the maximum value of f(Q) for all convex quadrilaterals Q is equal to 8. This solves a problem raised by Maehara (2001) in [4].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
