مرکز منطقه ای اطلاع رساني علوم و فناوري - An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points

Title of article :

An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points

Author/Authors :

R.L. Scot Drysdale، نويسنده , , Asish Mukhopadhyay، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2007

Pages :

From page :

To page :

Keywords :

computational geometry , Farthest-segment Voronoi diagram

Journal title :

Information Processing Letters

Serial Year :

2007

Journal title :

Information Processing Letters

Record number :

130530

Link To Document :