Last Updated:2022/12/24

This problem can be solved in time O(nᶜ) by combining a weight-balanced tree of the convex hull vertices with a farthest neighbor data structure of Agarwal and Matoušek [2].

音声機能が動作しない場合はこちらをご確認ください
Edit Histories(0)

Sentence quizzes to help you learn to read

Edit Histories(0)

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★