108 search results - page 4 / 22 » On Computing the Centroid of the Vertices of an Arrangement ... |
IAT
2009
IEEE
14 years 2 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
IWPEC
2004
Springer
14 years 25 days ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
WG
1994
Springer
13 years 11 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
IMR
2003
Springer
14 years 19 days ago
2003
Springer
Topology modification of hexahedral meshes has been considered difficult due to the propagation of topological modifications non-locally. We address this problem by working in the...