0
$\begingroup$

Given a trapezoidal map of a simple polygon $P$, is it possible to compute the triangulation of $P$ in $\mathcal{O}(n)$ time?

$\endgroup$
1
  • 1
    $\begingroup$ Yes it is possible. $\endgroup$
    – Evil
    Commented Nov 28, 2017 at 11:29

1 Answer 1

0
$\begingroup$

Yes, "it's easy to derive from such a decomposition of $P$ in linear time a triangulation of $P$."

Take a look at lemma 1. here.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.