607 search results - page 30 / 122 » Unifying Exact Completions |
101
click to vote
COMPGEOM
2008
ACM
15 years 21 days ago
2008
ACM
In this paper we introduce a unified framework for topological manipulation on triangulated 2-manifolds with or without boundary. We show that there are two kinds of primitive oper...
ICTAI
2005
IEEE
15 years 4 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
81
Voted
GMP
2000
IEEE
15 years 3 months ago
2000
IEEE
This paper describes a system which converts a twodimensional sketch with hidden lines removed of a single polyhedral object into a boundary representation solid model. The system...
96
Voted
JCT
2006
14 years 11 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
74
Voted
CCCG
2010
15 years 11 days ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...