• Publications
  • Influence
Efficient computation of query point visibility in polygons with holes
TLDR
In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. Expand
  • 39
  • 4
  • PDF
Streaming Algorithms for Line Simplification
TLDR
We study the following variant of the well-known line-simplification problem: we are getting a (possibly infinite) sequence of points p0,p1,p2,… in the plane defining a polygonal path, we wish to maintain a simplification of the path seen so far. Expand
  • 28
  • 3
Transesterification of waste cooking oil by heteropoly acid (HPA) catalyst: Optimization and kinetic model
Transesterification of waste cooking oil with heterogeneous (heteropoly acid) catalyst and methanol has been investigated. Response Surface Methodology (RSM) and Artificial Neural Network (ANN) wereExpand
  • 122
  • 3
Immobilized lipase-catalyzed transesterification of Jatropha curcas oil: Optimization and modeling
Abstract This study investigates the production of biodiesel from non-edible crude jatropha oil in the presence of an immobilized lipase catalyst. A modified method was used to immobilize RhizopusExpand
  • 36
  • 3
  • PDF
Streaming algorithms for line simplification
TLDR
We study the following variant of the well-known line-simpli-ficationproblem: we are getting a possibly infinite sequence of points p0,p1,p2,... in the plane defining a polygonal path, and as wereceive the points we wish to maintain a simplification of the pathseen so far. Expand
  • 25
  • 1
  • PDF
Query point visibility computation in polygons with holes
TLDR
In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. Expand
  • 16
  • 1
  • PDF
Using fuzzy Delphi method in maintenance strategy selection problem
In this paper, a new approach that applies fuzzy Delphi method in Simple Additive Weighting (SAW) is proposed to be used in the Maintenance Strategy Selection Problem (MSSP). This approach is basedExpand
  • 43
  • 1
  • PDF
Touring Disjoint Polygons Problem Is NP-Hard
TLDR
We prove that TPP is also NP-hard when the polygons are pairwise disjoint in any L p norm even if each polygon consists of at most two line segments. Expand
  • 4
  • 1
A Practical Approach for Planar Visibility Maintenance
In this paper, we propose a method for maintaining the region visible from a moving point observer inside a planar scene. In this method, we check the observer position in discrete time-stamps toExpand
  • 3
  • 1
  • PDF
Touring a sequence of disjoint polygons: Complexity and extension
TLDR
In the Touring Polygons Problem (TPP) there is a start point s, a sequence of simple polygons P = ( P 1 , ? , P k ) and a target point t in the plane. The goal is to obtain a path of minimum possible length that starts from s, visits in order each of the polygons in P and ends at t. This problem was introduced by Dror, Efrat, Lubiw and Mitchell in STOC '03. Expand
  • 13