13 search results - page 2 / 3 » Simplifying a polygonal subdivision while keeping it simple |
SI3D
2003
ACM
13 years 10 months ago
2003
ACM
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...
SODA
1997
ACM
13 years 6 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
DCOSS
2007
Springer
13 years 11 months ago
2007
Springer
Many emergent distributed sensing applications need to keep track of mobile entities across multiple sensor networks connected via an IP network. To simplify the realization of suc...
MM
2003
ACM
13 years 10 months ago
2003
ACM
To simplify the process of editing interactive video, we developed the concept of “detail-on-demand” video as a subset of general hypervideo. Detail-on-demand video keeps the ...
NGC
2001
Springer
13 years 9 months ago
2001
Springer
IP multicast suffers from scalability problems for large numbers of multicast groups, since each router keeps forwarding state proportional to the number of multicast tree passing ...