Sciweavers

397 search results - page 66 / 80
» Geometrical plenoptic sampling
Sort
View
GRAPHICSINTERFACE
1997
15 years 5 months ago
A Heuristic Method for Generating 2D CSG Trees from Bitmaps
This paper presents a method for generating compact and effective constructive-solid-geometry (CSG) object representations from 2D bitmap representations. The method consists of t...
Sarah F. Frisken Gibson, Joe Marks, Danielle Feinb...
WSC
2000
15 years 5 months ago
Simulating GI/GI/1 queues and insurance risk processes with subexponential distributions
This paper deals with estimating small tail probabilities of the steady-state waiting time in a GI/GI/1 queue with heavy-tailed (subexponential) service times. The problem of esti...
Nam Kyoo Boots, Perwez Shahabuddin
CGF
2008
121views more  CGF 2008»
15 years 4 months ago
Knitting a 3D Model
A knitted animal is made of a closed surface consisting of several knitted patches knitted out of yarn and stuffed with cotton (Fig. 1). We introduce a system to create a knitting...
Yuki Igarashi, Takeo Igarashi, Hiromasa Suzuki
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 4 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
IJRR
2008
80views more  IJRR 2008»
15 years 4 months ago
Motion Planning for Legged Robots on Varied Terrain
This paper studies the quasi-static motion of large legged robots that have many degrees of freedom. While gaited walking may suffice on easy ground, rough and steep terrain requi...
Kris K. Hauser, Timothy Bretl, Jean-Claude Latombe...