691 search results - page 36 / 139 » Axiomatizing geometric constructions |
SMA
2009
ACM
14 years 3 months ago
2009
ACM
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...
STOC
1999
ACM
14 years 29 days ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
GECCO
2006
Springer
14 years 10 days ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
SIAMSC
2010
13 years 7 months ago
2010
Abstract. In this article, we present a parallel geometric multigrid algorithm for solving elliptic partial differential equations (PDEs) on octree based conforming finite elemen...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...