مرکز منطقه ای اطلاع رساني علوم و فناوري - Using simplicial partitions to determine a closest point to a query line

Title of article :

Using simplicial partitions to determine a closest point to a query line

Author/Authors :

Asish Mukhopadhyay، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2003

Pages :

From page :

1915

To page :

1920

Keywords :

computational geometry , Pattern classification , Closest point , Simplicial partitions , Query line

Journal title :

PATTERN RECOGNITION LETTERS

Serial Year :

2003

Journal title :

PATTERN RECOGNITION LETTERS

Record number :

250693

Link To Document :