A parallel algorithm of constructing a Voronoi diagram on hypercube connected computer networks

Thesis (M.Sc.)--Memorial University of Newfoundland, 1995. Computer Science Bibliography: leaves 105-108. In process

Bibliographic Details
Main Author: Chai, Wenmao, 1963-
Other Authors: Memorial University of Newfoundland. Dept. of Computer Science
Format: Thesis
Language:English
Published: 1994
Subjects:
Voronoi polygons
Hypercube networks (Computer networks)
Computer algorithms
Geometry > Data processing
Newfoundland studies
University of Newfoundland
Online Access:http://collections.mun.ca/cdm/ref/collection/theses2/id/27092
id ftmemorialunivdc:oai:collections.mun.ca:theses2/27092
record_format openpolar
spelling ftmemorialunivdc:oai:collections.mun.ca:theses2/27092 2023-05-15T17:23:30+02:00 A parallel algorithm of constructing a Voronoi diagram on hypercube connected computer networks Chai, Wenmao, 1963- Memorial University of Newfoundland. Dept. of Computer Science 1994 xii, 108 leaves : ill. Image/jpeg; Application/pdf http://collections.mun.ca/cdm/ref/collection/theses2/id/27092 Eng eng Electronic Theses and Dissertations (10.51 MB) -- http://collections.mun.ca/PDFs/theses/Chai_Wenmao.pdf 76245842 http://collections.mun.ca/cdm/ref/collection/theses2/id/27092 The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission. Paper copy kept in the Centre for Newfoundland Studies, Memorial University Libraries Voronoi polygons Hypercube networks (Computer networks) Computer algorithms Geometry--Data processing Text Electronic thesis or dissertation 1994 ftmemorialunivdc 2015-08-06T19:16:30Z Thesis (M.Sc.)--Memorial University of Newfoundland, 1995. Computer Science Bibliography: leaves 105-108. In process Thesis Newfoundland studies University of Newfoundland Memorial University of Newfoundland: Digital Archives Initiative (DAI)
institution Open Polar
collection Memorial University of Newfoundland: Digital Archives Initiative (DAI)
op_collection_id ftmemorialunivdc
language English
topic Voronoi polygons
Hypercube networks (Computer networks)
Computer algorithms
Geometry--Data processing
spellingShingle Voronoi polygons
Hypercube networks (Computer networks)
Computer algorithms
Geometry--Data processing
Chai, Wenmao, 1963-
A parallel algorithm of constructing a Voronoi diagram on hypercube connected computer networks
topic_facet Voronoi polygons
Hypercube networks (Computer networks)
Computer algorithms
Geometry--Data processing
description Thesis (M.Sc.)--Memorial University of Newfoundland, 1995. Computer Science Bibliography: leaves 105-108. In process
author2 Memorial University of Newfoundland. Dept. of Computer Science
format Thesis
author Chai, Wenmao, 1963-
author_facet Chai, Wenmao, 1963-
author_sort Chai, Wenmao, 1963-
title A parallel algorithm of constructing a Voronoi diagram on hypercube connected computer networks
title_short A parallel algorithm of constructing a Voronoi diagram on hypercube connected computer networks
title_full A parallel algorithm of constructing a Voronoi diagram on hypercube connected computer networks
title_fullStr A parallel algorithm of constructing a Voronoi diagram on hypercube connected computer networks
title_full_unstemmed A parallel algorithm of constructing a Voronoi diagram on hypercube connected computer networks
title_sort parallel algorithm of constructing a voronoi diagram on hypercube connected computer networks
publishDate 1994
url http://collections.mun.ca/cdm/ref/collection/theses2/id/27092
genre Newfoundland studies
University of Newfoundland
genre_facet Newfoundland studies
University of Newfoundland
op_source Paper copy kept in the Centre for Newfoundland Studies, Memorial University Libraries
op_relation Electronic Theses and Dissertations
(10.51 MB) -- http://collections.mun.ca/PDFs/theses/Chai_Wenmao.pdf
76245842
http://collections.mun.ca/cdm/ref/collection/theses2/id/27092
op_rights The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission.
_version_ 1766112796498460672

Similar Items