Learn More
K-dimensional trees, abbreviated as k-d trees in the following, are binary search and partitioning trees which represent a set of n points in a multi-dimensional space [1]. K-d tree data structures have primarily been used for nearest neighbor queries and several other query types for example in database applications. [1] In the context of a research(More)
The general notion of thermal comfort as provided by heating, ventilation and air conditioning systems (HVAC) in existing office buildings does not necessarily suit the needs and perceptions of the individual. This can result in a continuous source of discomfort and interpersonal dispute in shared work environments such as open plan offices. Our research is(More)
  • 1