نتایج جستجو برای: epireflective hull

تعداد نتایج: 9493  

2012
Sandeep K. Dey Evanthia Papadopoulou

We present structural properties of the farthest line-segment Voronoi diagram in the piecewise linear L∞ and L1 metrics, which are computationally simpler than the standard Euclidean distance and very well suited for VLSI applications. We introduce the farthest line-segment hull, a closed polygonal curve that characterizes the regions of the farthest line-segment Voronoi diagram, and is related...

2008
Chen Liang Kwan-Yee Kenneth Wong

The marching cubes algorithm has been widely adopted for extracting a surface mesh from a volumetric description of the visual hull reconstructed from silhouettes. However, typical volumetric descriptions, such as an octree, provide only a binary description about the visual hull. The lack of interpolation information along each voxel edge, which is required by the marching cubes algorithm, usu...

2012
Peng He

Imprecision is a long-standing problem in CAD design and high accuracy image-based reconstruction applications. The visual hull which is the closed silhouette equivalent shape of the objects of interest is an important concept in image-based reconstruction. We extend the domain-theoretic framework, which is a robust and imprecision capturing geometric model, to analyze the imprecision in the ou...

Journal: :Computational Geometry 2001

Journal: :Minutes of the Proceedings of the Institution of Civil Engineers 1875

Journal: :The Lancet 1894

1998
ROBERT S. STRICHARTZ YANG WANG

For a self{similar or self{aane tile in R n we study the following questions: 1) What is the boundary? 2) What is the convex hull? We show that the boundary is a graph directed self{aane fractal, and in the self{similar case we give an algorithm to compute its dimension. We give necessary and suucient conditions for the convex hull to be a polytope, and we give a description of the Gauss map of...

2002
Chih-Fang Wang Sartaj Sahni

We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are used to compute convex hull and ECDF ...

Journal: :Zootaxa 2015
Sergio Ibáñez-Bernal Eric Fisher

A new name for the Oriental genus Nyssomyia Hull, 1962 (Diptera: Asilidae) is proposed. Homonymy exists between this Oriental robber fly genus and the more senior Neotropical phlebotomine sand fly genus Nyssomyia Barretto, 1962 (sensu Galati 2003) (Diptera: Psychodidae), and the following replacement name is proposed: Ekkentronomyia nom. nov. for Nyssomyia Hull (nec Barretto 1962). Accordingly,...

2014
David M. Mimno Moontae Lee

The anchor words algorithm performs provably efficient topic model inference by finding an approximate convex hull in a high-dimensional word co-occurrence space. However, the existing greedy algorithm often selects poor anchor words, reducing topic quality and interpretability. Rather than finding an approximate convex hull in a high-dimensional space, we propose to find an exact convex hull i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید