18 search results - page 3 / 4 » On computing enclosing isosceles triangles and related probl... |
COMGEO
2006
ACM
13 years 7 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...
ALGORITHMICA
2011
13 years 2 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
GRAPHICSINTERFACE
1998
13 years 9 months ago
1998
Displacement maps and procedural displacement shaders are a widely used approach of specifying geometric detail and increasing the visual complexity of a scene. While it is relati...
ICCV
2009
IEEE
15 years 24 days ago
2009
IEEE
This paper addresses the “boundary ownership” problem,
also known as the figure/ground assignment problem.
Estimating boundary ownerships is a key step in perceptual
organiz...
MOBIDE
2006
ACM
14 years 1 months ago
2006
ACM
An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node’s awareness of its position relative to the network. In t...