Searching for authors named "Asish Mukhopadhyay" – sorted by Relevance.
-
On the all-farthest-segments problem for a planar set of points
- of Points Asish Mukhopadhyay ∗ e-mail: asishm@(email omitted); Abstract In this note, we outline a very simple
- Cited by 3 (1 self) – Add To MetaCart
-
Efficient Algorithms for Computing the β-Spectrum
- , India E-mail: svrao@(email omitted); Asish Mukhopadhyay School of Computer Science University of Windsor
- Add To MetaCart
-
Using Simplicial Partitions to Determine a Closest Point to a Query Line
- Using simplicial partitions to determine a closest point to a query line Asish Mukhopadhyay
- Add To MetaCart
-
Optimally Computing a Shortest Weakly Visible Line Segment Inside a Simple Polygon
- Mathematical Sciences Department, University of Memphis, Memphis, TN 38152 Asish Mukhopadhyay 2 School of Comp
- Cited by 3 (0 self) – Add To MetaCart
-
Extreme Point Detection and the Polar Dual
- and Statistics ———————————————————– Asish Mukhopadhyay, External Reader School of Computer Science
- Add To MetaCart
-
Voronoi Diagrams for Direction-Sensitive Distances
- Northwestern University Evanston, IL 60208, U.S.A. e-mail: dtlee@(email omitted); Asish Mukhopadhyay Department
- Cited by 1 (1 self) – Add To MetaCart
-
Voronoi Diagrams for Direction-Sensitive Distances
- @(email omitted); Asish Mukhopadhyay Department of Computer Science Indian Institute of Technology, Kanpur UP-208016
- Add To MetaCart

