Selfish Herd with Moving and Non-Moving Voronoi Diagram in Two Dimensions and Application

Simple item page
dc.contributor.advisorHazlewood, Carol
dc.contributor.authorKai, Yasuharu
dc.date.accessioned2020-06-01T14:17:42Z
dc.date.available2020-06-01T14:17:42Z
dc.date.issued2004-08
dc.description.abstractVoronoi Diagrams of moving points are applied to Selfish Herd problems. A portable C ++ implementation with graphics is described. Data gathered from simulations using moving and non-moving Voronoi calculations are analyzed. The analysis shows that fewer complete Voronoi Diagrams are calculated using the moving Voronoi method. And also the results from simulations introduce some suggesstions to improve performance of the moving Voronoi Diagram.
dc.description.departmentComputer Science
dc.formatText
dc.format.extent155 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationKai, Y. (2004). Selfish herd with moving and non-moving voronoi diagram in two dimensions and application (Unpublished thesis). Texas State University-San Marcos, San Marcos, Texas.
dc.identifier.urihttps://hdl.handle.net/10877/10522
dc.language.isoen
dc.subjectVoronoi polygons
dc.subjectComputer algorithms
dc.titleSelfish Herd with Moving and Non-Moving Voronoi Diagram in Two Dimensions and Application
dc.typeThesis
thesis.degree.departmentComputer Science
thesis.degree.grantorTexas State University-San Marcos
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kai_Yasuharu_2004.pdf
Size:
2.74 MB
Format:
Adobe Portable Document Format
Download

Collections

Graduate Theses and Dissertations