Search Results - "Bhattacharya, Binay K."

Rectilinear path problems in restricted memory setup by Bhattacharya, Binay K., De, Minati, Maheshwari, Anil, Nandy, Subhas C., Roy, Sasanka

“…We study the rectilinear path problem in the presence of disjoint axis parallel rectangular obstacles in the read-only and in-place setup. The input to the…”
Get full text

Some variations on constrained minimum enclosing circle problem by Karmakar, Arindam, Das, Sandip, Nandy, Subhas C., Bhattacharya, Binay K.

“…Given a set P of n points and a straight line L , we study three important variations of minimum enclosing circle problem as follows: Computing k identical…”
Get full text

Space-efficient algorithm for computing a centerpoint of a set of points in R2 by Bhattacharya, Binay K., Nandy, Subhas C., Roy, Sasanka

“…We study a space-efficient algorithm for computing a centerpoint for a set P of n points in R2, where the points in P are given in a read-only array. We…”
Get full text

Space-efficient algorithm for computing a centerpoint of a set of points in R 2 by Bhattacharya, Binay K., Nandy, Subhas C., Roy, Sasanka

Get full text

Space-efficient algorithm for computing a centerpoint of a set of points in by Bhattacharya, Binay K, Nandy, Subhas C, Roy, Sasanka

“…We study a space-efficient algorithm for computing a centerpoint for a set P of n points in , where the points in P are given in a read-only array. We propose…”
Get full text

On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm by Bhattacharya, Binay K, Sen, Sandeep

“…In this paper we present a truly practical and provably optimalO(nlogh) time output-sensitive algorithm for the planar convex hull problem. The basic algorithm…”
Get full text

Single facility collection depots location problem in the plane by Benkoczi, Robert, Bhattacharya, Binay K., Das, Sandip, Sember, Jeff

“…In this paper we consider an extension of the classical facility location problem where besides n weighted customers, a set of p collection depots are also…”
Get full text

Characterizing LR-visibility polygons and related problems☆☆The extended abstract of this paper was presented at the Tenth Canadian Conference on Computational Geometry, 1998 by Bhattacharya, Binay K., Ghosh, Subir Kumar

Get full text

Characterizing LR-visibility polygons and related problems by Bhattacharya, Binay K., Ghosh, Subir Kumar

“…A simple polygon P is said to be LR-visibility polygon if there exists two points s and t on the boundary of  P such that every point of the clockwise boundary…”
Get full text

Efficient computation of 2-medians in a tree network with positive/negative weights by Benkoczi, Robert R., Bhattacharya, Binay K., Breton, David

Get full text

APPLICATION OF COMPUTATIONAL GEOMETRY TO PATTERN RECOGNITION PROBLEMS by BHATTACHARYA, BINAY K

“…In this thesis it is shown that several pattern recognition problems can be solved efficiently by exploiting the geometrical structure of the problems. The…”
Get full text

Facility location problems in the constant work-space read-only memory model by Bhattacharya, Binay K, De, Minati, Nandy, Subhas C, Roy, Sasanka

“…Facility location problems are captivating both from theoretical and practical point of view. In this paper, we study some fundamental facility location…”
Get full text

Optimally computing a shortest weakly visible line segment inside a simple polygon by Bhattacharya, Binay K., Das, Gautam, Mukhopadhyay, Asish, Narasimhan, Giri

“…A simple polygon is said to be weakly internally visible from a line segment lying inside it if every point on the boundary of the polygon is visible from some…”
Get full text

AnO(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs by Bhattacharya, Binay K., Kaller, Damon

“…We present an algorithm to compute, inO(m+nlogn) time, a maximum clique in circular-arc graphs (withnvertices andmedges) provided a circular-arc model of the…”
Get full text

An O(m + n log n) algorithm for the maximum-clique problem in circular-arc graphs by BHATTACHARYA, B. K, KALLER, D

Get full text

APPLICATION OF COMPUTATIONAL GEOMETRY TO PATTERN RECOGNITION PROBLEMS by BHATTACHARYA, BINAY K

“…In this thesis it is shown that several pattern recognition problems can be solved efficiently by exploiting the geometrical structure of the problems. The…”
Get full text

Computing the volume of the union of spheres by AVIS, D, BHATTACHARYA, B. K, IMAI, H

Get full text

An upper bound on the probability of misclassification in terms of Matusita's measure of affinity by Bhattacharya, Binay K., Toussaint, Godfried T.

Get full text

Some numerical computations in linear estimation by Bhattacharya, Binay K

Get full text

A new linear convex hull algorithm for simple polygons (Corresp.) by Bhattaeharya, B., Elgindy, H.

“…A new optimal algorithm for computing the convex hull of a simple polygon in the plane, along with a proof of correctness, is presented. The main novelty of…”
Get full text