Title of article :
A lower bound on Voronoi diagram complexity
Author/Authors :
Boris Aronov، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2002
Pages :
3
From page :
183
To page :
185
Keywords :
computational complexity , Voronoi diagram , Computational geometry
Journal title :
Information Processing Letters
Serial Year :
2002
Journal title :
Information Processing Letters
Record number :
129561
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129561
بازگشت