102291 search results - page 148 / 20459 » Computability in Computational Geometry |
191
click to vote
COMGEO
2006
ACM
15 years 5 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
143
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
161
click to vote
ASPDAC
2007
ACM
15 years 9 months ago
2007
ACM
In recent years, several alternative devices have been proposed to deal with inherent limitation of conventional CMOS devices in terms of scalability at nanometer scale geometry. ...
123
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
148
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...