For a given point set P or a polygon P , we consider the problem of finding a triangulation T with minimum stabbing number, i.e., a triangulation such that the maximal number of segments hit by any ray going through T is minimized. We prove that this problem is NP-hard; this differs from the problem of triangulating a polygon with minimum edge weight, which is solvable in polynomial time with a...

Sir,?I read with interest in your issue of August 1936 a case reported under the above heading. Two 3*ears ago when I was working as civil surgeon. Dwarka, near Post Okha, I came across a similar case in which a man?a renowned convict who was released ten years ago from Baroda Central Jail for his good behaviour and who had turned very religious since rhen?stabbed his abdomen with two similar c...

David M. Mount Fan-Tao Pu Department of Computer Science University of Maryland College Park, MD 20742 fmount,[email protected] 1 Motivation Computer graphics is the source of many interesting and challenging applications for the design of geometric algorithms and data structures. Applications in global illumination simulation and radiosity [7] have motivated our study of problems involving line...