{"id":{"repo_id":"twu","oai_identifier":"oai:twu-ir.tdl.org:11274/12058"},"canonical_url":"https://search.dev.ndltd.org/etd/twu/oai:twu-ir.tdl.org:11274/12058","repository":{"repo_id":"twu","name":"Texas Woman's University","base_url":"https://twu-ir.tdl.org/server/oai/request"},"display":{"title":"The inverse problem to the Voronoi diagram","abstract":"The primary purpose of this thesis is to address the problem of solving the Inverse Problem for the Voronoi Diagram where the Inverse Problem is: Given a diagram that is in fact a Voronoi Diagram find the set of points X = {x1, x2, x3,…,x n} in R2 that will generate the diagram. In formulating a solution to the Inverse Problem it was necessary that we consider the problem of characterizing Voronoi Diagrams. In developing an algorithm for determining the generating set we considered questions of the form: Is the solution to the Inverse Problem unique? If the solution to the Inverse Problem is not unique, then what properties characterize the Voronoi Diagram? In addition we will develop solutions to a set of problems related to Voronoi Diagrams. These problems are related to: Given a finite set of points X = {x1, x2, x3,…,x n} in R2 find the domain of points Nk such that for every x &egr; N k, xk is the nearest point to x, that is,","abstract_html":"The primary purpose of this thesis is to address the problem of solving the Inverse Problem for the Voronoi Diagram where the Inverse Problem is: Given a diagram that is in fact a Voronoi Diagram find the set of points X = {x1, x2, x3,…,x n} in R2 that will generate the diagram. In formulating a solution to the Inverse Problem it was necessary that we consider the problem of characterizing Voronoi Diagrams. In developing an algorithm for determining the generating set we considered questions of the form: Is the solution to the Inverse Problem unique? If the solution to the Inverse Problem is not unique, then what properties characterize the Voronoi Diagram? In addition we will develop solutions to a set of problems related to Voronoi Diagrams. These problems are related to: Given a finite set of points X = {x1, x2, x3,…,x n} in R2 find the domain of points Nk such that for every x &egr; N k, xk is the nearest point to x, that is,","abstract_has_math":false,"creators":["Winter, Lisa G."],"institution":"Texas Woman's University","degree_name":"Master of Science","degree_level":"Master","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Zimmerman, Wayne J."],"committee_members":["Hamner, Mark S.","Hogan, Turner"],"year":2007,"date_issued":"2007-05","date_published":"2007-05","updated_at":"2026-07-24T05:05:09Z","subjects":["Pure sciences","Combinatorial geometry","Convexity"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/11274/12058","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Zimmerman, Wayne J."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Hamner, Mark S.","Hogan, Turner"]},{"key":"dc:creator","label":"Author","values":["Winter, Lisa G."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-12-06T17:15:28Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-12-06T17:15:28Z"]},{"key":"dc:date.issued","label":"Date","values":["2007-05"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Master"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Texas Woman's University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Pure sciences","Combinatorial geometry","Convexity"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/11274/12058"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The primary purpose of this thesis is to address the problem of solving the Inverse Problem for the Voronoi Diagram where the Inverse Problem is: Given a diagram that is in fact a Voronoi Diagram find the set of points X = {x1, x2, x3,…,x n} in R2 that will generate the diagram. In formulating a solution to the Inverse Problem it was necessary that we consider the problem of characterizing Voronoi Diagrams. In developing an algorithm for determining the generating set we considered questions of the form: Is the solution to the Inverse Problem unique? If the solution to the Inverse Problem is not unique, then what properties characterize the Voronoi Diagram? In addition we will develop solutions to a set of problems related to Voronoi Diagrams. These problems are related to: Given a finite set of points X = {x1, x2, x3,…,x n} in R2 find the domain of points Nk such that for every x &egr; N k, xk is the nearest point to x, that is,","x − xk","£","x − xj","for every j ≠ k."]},{"key":"dc:title","label":"Title","values":["The inverse problem to the Voronoi diagram"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Zimmerman, Wayne J."],"dc:contributor.committeemember":["Hamner, Mark S.","Hogan, Turner"],"dc:creator":["Winter, Lisa G."],"dc:date.accessioned":["2019-12-06T17:15:28Z"],"dc:date.available":["2019-12-06T17:15:28Z"],"dc:date.issued":["2007-05"],"dc:description.abstract":["The primary purpose of this thesis is to address the problem of solving the Inverse Problem for the Voronoi Diagram where the Inverse Problem is: Given a diagram that is in fact a Voronoi Diagram find the set of points X = {x1, x2, x3,…,x n} in R2 that will generate the diagram. In formulating a solution to the Inverse Problem it was necessary that we consider the problem of characterizing Voronoi Diagrams. In developing an algorithm for determining the generating set we considered questions of the form: Is the solution to the Inverse Problem unique? If the solution to the Inverse Problem is not unique, then what properties characterize the Voronoi Diagram? In addition we will develop solutions to a set of problems related to Voronoi Diagrams. These problems are related to: Given a finite set of points X = {x1, x2, x3,…,x n} in R2 find the domain of points Nk such that for every x &egr; N k, xk is the nearest point to x, that is,","x − xk","£","x − xj","for every j ≠ k."],"dc:identifier.uri":["https://hdl.handle.net/11274/12058"],"dc:language.iso":["en_US"],"dc:subject":["Pure sciences","Combinatorial geometry","Convexity"],"dc:title":["The inverse problem to the Voronoi diagram"],"dc:type":["Thesis"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Master"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Texas Woman's University"]},"updated_at":"2026-07-24T05:05:09Z"}