Sciweavers

2255 search results - page 106 / 451
» Computing a Center-Transversal Line
Sort
View
SIBGRAPI
2003
IEEE
15 years 11 months ago
A Non-Self-Intersection Douglas-Peucker Algorithm
The classical Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It is used extensivel...
Shin-Ting Wu, Mercedes Rocío Gonzales M&aac...
CGF
2004
106views more  CGF 2004»
15 years 6 months ago
High Quality Hatching
Hatching lines are often used in line illustrations to convey tone and texture of a surface. In this paper we present methods to generate hatching lines from polygonal meshes and ...
Johannes Zander, Tobias Isenberg, Stefan Schlechtw...
IMS
2000
125views Hardware» more  IMS 2000»
15 years 10 months ago
Compiler-Directed Cache Line Size Adaptivity
The performance of a computer system is highly dependent on the performance of the cache memory system. The traditional cache memory system has an organization with a line size tha...
Dan Nicolaescu, Xiaomei Ji, Alexander V. Veidenbau...
CCCG
2003
15 years 7 months ago
Shortest Paths in Two Intersecting Pencils of Lines
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
David Hart
SIMVIS
2001
15 years 7 months ago
Subdivision for Line Drawings
This paper presents approaches of incorporating subdivision techniques in the rendering process for computer-generated line drawings. A new method for accelerating silhouette dete...
Bert Freudenberg