A greedy heuristic for axial line placement in collections of convex polygons

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Hagger, Leonard
dc.date.accessioned 2006-02-15T08:03:10Z
dc.date.available 2006-02-15T08:03:10Z
dc.date.issued 2006-02-15
dc.identifier.uri http://hdl.handle.net/10539/194
dc.description Master of Science - Science en
dc.description.abstract Axial line placement is one step in a method known as space syntax which is used in town planning to analyse architectural structures. This is becoming increasingly important in the quickly growing urban world of today. The field of axial line placement is an area of space syntax that has previously been done manually which is becoming increasingly impractical. Research is underway to automate the process and this research forms a large part of the automation. The general problem of axial line placement has been shown to be NP-complete. For this reason, previous research in this field has been focused on finding special cases where this is not the case or finding heuristics that approximate a solution. The majority of the research conducted has been on the simpler case of axial line placement in configurations of orthogonal rectangles and the only work done with convex polygons has been in the restricted case of deformed urban grids. This document presents research that finds two non-trivial special cases of convex polygons that have polynomial solutions and finds the first heuristic for general configurations of convex polygons. en
dc.format.extent 837740 bytes
dc.format.mimetype application/pdf
dc.language.iso en
dc.subject heuristic en
dc.subject axial line en
dc.subject greedy en
dc.subject convex en
dc.subject polygons en
dc.title A greedy heuristic for axial line placement in collections of convex polygons en
dc.type Thesis en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search WIReDSpace


Advanced Search

Browse

My Account

Statistics