HEAL DSpace

Application of binary spatial partitioning to Computer Aided Design

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Stamos, AA en
dc.date.accessioned 2014-03-01T02:51:33Z
dc.date.available 2014-03-01T02:51:33Z
dc.date.issued 2008 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/35554
dc.relation.uri http://www.scopus.com/inward/record.url?eid=2-s2.0-84858386116&partnerID=40&md5=09d2ce0696f6a3509b1586d65018eeb4 en
dc.subject Binary spatial partitioning en
dc.subject Computer aided design en
dc.subject.other 3-dimension en
dc.subject.other Bsp-trees en
dc.subject.other CAD applications en
dc.subject.other Computer aided en
dc.subject.other Drawing elements en
dc.subject.other Engineering drawing en
dc.subject.other Higher dimensions en
dc.subject.other Interactive Environments en
dc.subject.other Irregular geometries en
dc.subject.other Physical elements en
dc.subject.other Quad trees en
dc.subject.other Spatial partitioning en
dc.subject.other Tree data structures en
dc.subject.other Computer aided design en
dc.subject.other Computer control en
dc.subject.other Reforestation en
dc.subject.other Binary trees en
dc.title Application of binary spatial partitioning to Computer Aided Design en
heal.type conferenceItem en
heal.publicationDate 2008 en
heal.abstract Computer Aided Design (CAD) applications usually need to store and process dynamically and efficiently various drawing elements. Typically the quad-tree data structure is used in 2 dimensions and the octant-tree data structure in 3 dimensions. Here the Binary Spatial Partitioning (BSP) tree data structure is proposed for CAD applications. BSP scales better in irregular geometries such as long narrow engineering drawings, it has less overhead, it is easier to implement, it and it is easily extended to 3 and higher dimensions. Modifications to BSP are proposed to adapt it better to interactive environments. Elements are not broken when a BSP node is split keeping BSP size small. Physical elements size limit the depth and the fragmentation of the BSP trees. Semi-infinite BSP nodes delay the BSP structure finalization, improving BSP balance. The knowledge of drawing extents ensures BSP balance when the BSP structure is rebuilt after a drawing regeneration. Finally implementation related issues are addressed. © 2008 Civil-Comp Press. en
heal.journalName Proceedings of the 6th International Conference on Engineering Computational Technology en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής