Skip to search formSkip to main contentSkip to account menu

Kinetic data structure

A kinetic data structure is a data structure used to track an attribute of a geometric system that is moving continuously.For example, a kinetic… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
In this paper, we study the problem of evolutionary clustering of multi-typed objects in a heterogeneous bibliographic network… 
2007
2007
Given a planar workpiece R, the objective of region coverage is to find an ordered list of waypoints and the geometry of paths… 
2004
2004
Site managers spend a significant amount of time measuring, recording and analysing progress on site. Information is continuously… 
2004
2004
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but… 
2003
2003
New configuration is presented for ultra-fast at-wavelength inspection of defects on multilayer mask blanks. Key idea are… 
1989
1989
If it could be said that a single goal has motivated the development of advanced electronic systems over the past thirty years… 
1976
1976
We prove that if a countably compact space X has an open cover QL = U ({ f: n < w} such that each x E X is in at least one but… 
Review
1973
Review
1973
The ideas and techniques of physics have been systematically applied to the study of living matter since the 1950s and 1960s. As… 
1973
1973
TRUMPETS, bassoons and other long wind instruments are made with bends for compactness. They would function best if each bend… 
1968
1968
THERE is evidence which suggests that the tracks of muons and of electrons in electron showers may leave detectable marks in…