21 research outputs found
Recommended from our members
Subquadratic nonobtuse triangulation of convex polygons
A convex polygon with n sides can be triangulated by O(n^1.85) triangles, without any obtuse angles. The construction uses a novel form of geometric divide and conquer
Acute and nonobtuse triangulations of polyhedral surfaces
In this paper, we prove the existence of acute triangulations for general polyhedral surfaces. We also show how to obtain nonobtuse subtriangulations of triangulated polyhedral surfaces.Massachusetts Institute of Technology (UROP Program
Survey of two-dimensional acute triangulations
AbstractWe give a brief introduction to the topic of two-dimensional acute triangulations, mention results on related areas, survey existing achievements–with emphasis on recent activity–and list related open problems, both concrete and conceptual
3D Mesh Simplification. A survey of algorithms and CAD model simplification tests
Simplification of highly detailed CAD models is an important step when CAD
models are visualized or by other means utilized in augmented reality applications.
Without simplification, CAD models may cause severe processing and storage is-
sues especially in mobile devices. In addition, simplified models may have other
advantages like better visual clarity or improved reliability when used for visual pose
tracking. The geometry of CAD models is invariably presented in form of a 3D
mesh. In this paper, we survey mesh simplification algorithms in general and focus
especially to algorithms that can be used to simplify CAD models. We test some
commonly known algorithms with real world CAD data and characterize some new
CAD related simplification algorithms that have not been surveyed in previous mesh
simplification reviews.Siirretty Doriast