125
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
118
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
129
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
The ray shooting problem arises in many different contexts and is a bottleneck of ray tracing in computer graphics. Unfortunately, theoretical solutions to the problem are not ver...
87
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
81
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, an...
75
Voted
CIE
2006
Springer
15 years 23 days ago
2006
Springer
78
Voted
CIE
2006
Springer
15 years 23 days ago
2006
Springer
84
Voted
CIE
2006
Springer
15 years 23 days ago
2006
Springer
72
Voted
CIE
2006
Springer
15 years 23 days ago
2006
Springer