3025 search results - page 372 / 605 » Computational geometry: a retrospective |
194
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
175
click to vote
CCCG
2004
15 years 8 months ago
2004
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
179
Voted
DAGSTUHL
2006
15 years 8 months ago
2006
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
166
click to vote
FLAIRS
2004
15 years 8 months ago
2004
A methodology for surveillance of multiple targets through a distributed mobile sensor network is proposed in this paper. We examine coordination among sensors that monitor a rect...
171
click to vote
IWEC
2004
15 years 8 months ago
2004
Procedural techniques will soon automate many aspects of content creation for computer games. We describe an efficient, deterministic, methodology for procedurally generating 3D ga...