3025 search results - page 432 / 605 » Computational geometry: a retrospective |
207
click to vote
SMI
2003
IEEE
16 years 11 days ago
2003
IEEE
In this paper, we present a novel modeling method for synthesizing rough surfaces using discrete surface growth models. We employ a two-pass method. Initial point cluster data is ...
198
Voted
VISUALIZATION
2003
IEEE
16 years 11 days ago
2003
IEEE
Unstructured meshes are often used in simulations and imaging applications. They provide advanced flexibility in modeling abilities but are more difficult to manipulate and anal...
209
click to vote
SMA
2003
ACM
16 years 10 days ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
225
click to vote
WSNA
2003
ACM
16 years 10 days ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
214
click to vote
COMPGEOM
2010
ACM
16 years 5 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...