Author:
Bitner Steven,Daescu Ovidiu
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference8 articles.
1. Farthest line segment Voronoi diagrams;Aurenhammer;Inform. Process. Lett.,2006
2. Proximity problems on line segments spanned by points;Daescu;Comput. Geom.,2006
3. Extremal point queries with lines and line segments and related problems;Daescu;Comput. Geom.,2005
4. An o(nlogn) algorithm for the all-farthest-segments problem for a planar set of points;Scot Drysdale;Inform. Process. Lett.,2008
5. A. Dumitrescu, C. Toth, On the number of tetrahedra with minimum, unit, and distinct volumes in three-space, in: Proc. 18th Sympos. Discrete Algorithms, 2007