691 search results - page 21 / 139 » Axiomatizing geometric constructions |
135
Voted
CORR
2010
Springer
15 years 15 days ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
108
Voted
AI
2007
Springer
15 years 16 days ago
2007
Springer
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...
100
Voted
SMA
2003
ACM
15 years 5 months ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
115
Voted
FAW
2009
Springer
15 years 7 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
86
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...