Sciweavers

90 search results - page 11 / 18
» Formalizing complex plane geometry
Sort
View
COMPGEOM
2005
ACM
14 years 11 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
14 years 9 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak
JMMA
2002
90views more  JMMA 2002»
14 years 9 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
GIS
2008
ACM
14 years 10 months ago
Towards a geometric interpretation of double-cross matrix-based similarity of polylines
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
Bart Kuijpers, Bart Moelans
BMCBI
2010
259views more  BMCBI 2010»
14 years 4 months ago
Rule-based spatial modeling with diffusing, geometrically constrained molecules
Background: We suggest a new type of modeling approach for the coarse grained, particle-based spatial simulation of combinatorially complex chemical reaction systems. In our appro...
Gerd Gruenert, Bashar Ibrahim, Thorsten Lenser, Ma...