• Publications
  • Influence
Approximate Euclidean shortest path in 3-space
TLDR
Papadimitriou's approximation approach to the Euclidean shortest path (ESP) problem in 3-space is revisited. Expand
  • 86
  • 2
Approximate Euclidean Shortest Paths in 3-Space
TLDR
Papadimitriou's approximation approach to the Euclidean shortest path (ESP) in 3-space is revisited in the framework of bit complexity. Expand
  • 45
  • 2
Design, Analysis, and Optimization of LCD Backlight Unit Using Ray Tracing Simulation
TLDR
An analysis method based on Monte Carlo photon tracing to evaluate the optical performance of BLU is presented. Expand
  • 12
  • 2
  • PDF
Precision-Sensitive Euclidean Shortest Path in 3-Space
TLDR
This paper introduces the concept of precision- sensitive algorithms, analogous to the well-known output-sensitive algorithms. Expand
  • 44
  • 1
  • PDF
Performance Study of Satellite Image Processing on Graphics Processors Unit Using CUDA
TLDR
We proposed a technique for parallel processing of high resolution satellite images using GPU. Expand
  • 5
  • 1
  • PDF
Precision-sensitive Euclidean shortest path in 3-space (extended abstract)
TLDR
Disclosed is a monopolar membrane cell in which identical anode and cathode pans are stamped from bimetallic laminate material in which an electrolyte resistant material is utilized on the inside of the electrolytic cell and a highly conductive metal is utilizedon the outside thereof. Expand
  • 18
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles
TLDR
Given a set B of obstacles and a set S of source points in the plane, the problem of finding a set of points subject to a certain objective function with respect to B and S is a basic problem in applications such as facility location problem 5. Expand
  • 11
Monotonicity of rectilinear geodesics in d-space
TLDR
A panic-proof lockset includes a deadbolt and a spring latch. Expand
  • 8
Contour-based partial object recognition using symmetry in image databases
TLDR
We present the robust method for recognizing partially occluded objects based on symmetry properties, which is based on the contours of objects. Expand
  • 15
Algorithms for finding disjoint path covers in unit interval graphs
TLDR
A many-to-many k -disjoint path cover ( k -DPC for short) of a graph G joining the pairwise disjoint vertex sets S and T , each of size k , is a collection of k vertex-disjointed paths that altogether cover every vertex of G . Expand
  • 7
  • PDF