Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Joseph Szakas Articles by Christian Trefftz

18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 15

Santa Fe, New Mexico

April 26-April 30

ISBN: 0-7695-2132-0

	ASCII Text	x
	Joseph Szakas, Christian Trefftz, "Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull," Parallel and Distributed Processing Symposium, International, vol. 16, pp. 262a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 15, 2004.

	BibTex	x
	@article{ 10.1109/IPDPS.2004.1303332, author = {Joseph Szakas and Christian Trefftz}, title = {Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull}, journal ={Parallel and Distributed Processing Symposium, International}, volume = {16}, year = {2004}, isbn = {0-7695-2132-0}, pages = {262a}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303332}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel and Distributed Processing Symposium, International TI - Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull SN - 0-7695-2132-0 SP EP A1 - Joseph Szakas, A1 - Christian Trefftz, PY - 2004 KW - null VL - 16 JA - Parallel and Distributed Processing Symposium, International ER -

Joseph Szakas, University of Maine at Augusta

Christian Trefftz, Grand Valley State University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303332

Two Parallel Computational Geometry Algorithms are presented: One to calculate a Discrete Voronoi Diagram when one of the seeds is removed and one to calculate the convex hull in two dimensions. The model of parallel processing used for these algorithms assumes the availability of one processor per pixel. The recent growth in the capacity of FPGAs [5] and Systems-on-chip makes these algorithms interesting again.

Citation:

Joseph Szakas, Christian Trefftz, "Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull," ipdps, vol. 16, pp.262a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 15, 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.