Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,250,725 papers from all fields of science
Search
Sign In
Create Free Account
Local feature size
Local feature size refers to several related concepts in computer graphics and computational geometry for measuring the size of a geometric object…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Chew's second algorithm
Computational geometry
Computer graphics
Planar straight-line graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Normal variation for adaptive feature size
N. Amenta
,
T. Dey
arXiv.org
2014
Corpus ID: 15878106
The change in the normal between any two nearby points on a closed, smooth surface is bounded with respect to the local feature…
Expand
2012
2012
A Robust and Centered Curve Skeleton Extraction from 3D Point Cloud
V. Sam
,
H. Kawata
,
T. Kanai
2012
Corpus ID: 111735567
AbstractA curve skeleton of a 3D object is one of the most important structures of the object, which is extremely useful for many…
Expand
2011
2011
Local feature size based Delaunay tetrahedral mesh generation from medical volume data
Zhou Yun
2011
Corpus ID: 123957308
This paper presented a Delaunay algorithm based on local feature size to generate tetrahedral mesh from medical volume data for…
Expand
2011
2011
Localized Cocone surface reconstruction
T. Dey
,
R. Dyer
,
Lei Wang
Computers & graphics
2011
Corpus ID: 206373445
Highly Cited
2008
Highly Cited
2008
Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
F. Chazal
,
A. Lieutier
Computational geometry
2008
Corpus ID: 18555681
2008
2008
The Lobatto Cell: Robust, Explicit, Higher Order FDTD That Handles Inhomogeneous Media
R. Chilton
,
Robert Lee
IEEE Transactions on Antennas and Propagation
2008
Corpus ID: 30006964
To improve numerical dispersion and second-order convergence behavior of the traditional Yee finite-difference time-domain (FDTD…
Expand
2008
2008
3D Delaunay Refinement of Sharp Domains without a Local Feature Size Oracle
Alexander Rand
,
N. Walkington
International Meshing Roundtable Conference
2008
Corpus ID: 1107157
A practical incremental refinement algorithm for computing a quality, conforming Delaunay mesh of an arbitrary 3D piecewise…
Expand
Highly Cited
2005
Highly Cited
2005
Weak feature size and persistent homology: computing homology of solids in Rn from noisy data samples
F. Chazal
,
A. Lieutier
SCG
2005
Corpus ID: 14369408
In this work, one proves that under quite general assumptions one can deduce the topology of a bounded open set in Rn from a…
Expand
2002
2002
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited
D. Freedman
Computational geometry
2002
Corpus ID: 10564648
2002
2002
On the approximation of a smooth surface with a triangulated mesh
J. Morvan
,
Boris Thibert
Computational geometry
2002
Corpus ID: 206099404
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE