Sciweavers

7129 search results - page 919 / 1426
» Approximation Algorithms for Treewidth
Sort
View
JPDC
2007
138views more  JPDC 2007»
15 years 4 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
161
Voted
CAD
2004
Springer
15 years 4 months ago
Reduce the stretch in surface flattening by finding cutting paths to the surface boundary
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
Charlie C. L. Wang, Yu Wang 0010, Kai Tang, Matthe...
SIAMJO
2000
108views more  SIAMJO 2000»
15 years 4 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
CGF
1998
116views more  CGF 1998»
15 years 4 months ago
A Light Hierarchy for Fast Rendering of Scenes with Many Lights
We introduce a new data structure in the form of a light hierarchy for efficiently ray-tracing scenes with many light sources. An octree is constructed with the point light sourc...
Eric Paquette, Pierre Poulin, George Drettakis
JAL
1998
85views more  JAL 1998»
15 years 4 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay