Change search
ReferencesLink to record
Permanent link

Direct link
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects
Show others and affiliations
Number of Authors: 5
2007 (English)Report (Other academic)
Abstract [en]

This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time constraints. The constraint kernel is generic in the sense that one of its parameters is a set of constraints on subsets of the objects. These constraints are handled globally by the kernel. We first illustrate how to model several placement problems with the constraint kernel. We then explain how new constraints can be introduced and plugged into the kernel. Based on these interfaces, we develop a generic k-dimensional lexicographic sweep algorithm for filtering the attributes of an object (i.e., its shape and the coordinates of its origin as well as its start, duration and end in time) according to all constraints where the object occurs. Experiments involving up to hundreds of thousands of objects and 1 million integer variables are provided in 2, 3 and 4 dimensions, both for simple shapes (i.e., rectangles, parallelepipeds) and for more complex shapes.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 2007, 1. , 45 p.
SICS Technical Report, ISSN 1100-3154 ; 2007:08
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14417OAI: diva2:1035706
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(278 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 278 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link