5210 search results - page 366 / 1042 » Exact geometric computation |
197
click to vote
SOFSEM
2005
Springer
16 years 8 days ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
171
click to vote
GD
2005
Springer
16 years 7 days ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
168
click to vote
ICIP
2003
IEEE
16 years 2 days ago
2003
IEEE
Existing algorithms for exact helical cone beam (HCB) tomographic reconstruction are computationally infeasible for clinical applications. Their computational cost is dominated by...
166
click to vote
DIS
2001
Springer
15 years 11 months ago
2001
Springer
Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimiza...
198
click to vote
DIS
2000
Springer
15 years 11 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...