5356 search results - page 347 / 1072 » Adventures in time and space |
153
click to vote
ANSS
2000
IEEE
15 years 11 months ago
2000
IEEE
A specification language was defined to outline sections of cities as cell spaces. The goal is to allow the definition of complex traffic models in a simple fashion for the modele...
170
click to vote
COMPGEOM
1996
ACM
15 years 11 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
166
click to vote
FOCS
1990
IEEE
15 years 11 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
206
click to vote
JCDCG
2000
Springer
15 years 10 months ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
217
click to vote
COMPGEOM
1991
ACM
15 years 10 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...