A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon

Author： Berman P.   Lingas A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.174, Iss.1, 1997-03, pp. : 193-202

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Linear algorithm to find the largest intriangles of a planar convex polygon

By Pujari Arun K   Nataraj A  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 25, Iss. 5, 1996-05 ,pp. : 53-59

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

A nearly-optimal Fano-based coding algorithm

By Rueda L.G.   Oommen B.J.  

Information Processing and Management, Vol. 40, Iss. 2, 2004-03 ,pp. : 257-268

Elsevier

Access to resources Recommend Favorite

A fast algorithm for constructing nearly optimal prefix codes

By  

SOFTWARE:PRACTICE AND EXPERIENCE, Vol. 46, Iss. 10, 2016-10 ,pp. : 1299-1316

John Wiley & Sons Inc

Access to resources Recommend Favorite

Rounding Voronoi diagram

By Devillers O.   Gandoin P.-M.  

Theoretical Computer Science, Vol. 283, Iss. 1, 2002-06 ,pp. : 203-221

Elsevier

Access to resources Recommend Favorite

Polygon visibility ordering via Voronoi diagrams

By Fukushige Shinichi   Suzuki Hiromasa  

The Visual Computer, Vol. 23, Iss. 7, 2007-07 ,pp. : 503-511

Springer Publishing Company

Access to resources Recommend Favorite