Author of the publication

On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area.

, , and . ICCSA (1), volume 4705 of Lecture Notes in Computer Science, page 41-54. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane., , , , and . Trans. Comput. Sci., (2018)On the All-Farthest-Segments problem for a planar set of points., , and . Inf. Process. Lett., 100 (3): 120-123 (2006)On the Ordinary Line Problem in Computational Geometry., , and . Nord. J. Comput., 4 (4): 330-341 (1997)A Solution to the Polynomial Hensel Code Conversion Problem.. IEEE Trans. Computers, 36 (5): 634-637 (1987)On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area., , and . Int. J. Comput. Geom. Appl., 19 (6): 557-577 (2009)Optimal algorithms for some intersection radius problems., , , and . Computing, 52 (3): 269-279 (1994)Improved upper and lower bounds for the point placement problem, and . CoRR, (2012)An Algorithm for Generating Strongly Chordal Graphs., , and . CoRR, (2018)Molecular Structure Determination in the Phillips' Model: A Degree of Freedom Approach., , , and . ICCSA (2), volume 10961 of Lecture Notes in Computer Science, page 412-424. Springer, (2018)An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons., , and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 92-103. Springer, (1992)