102291 search results - page 143 / 20459 » Computability in Computational Geometry |
133
click to vote
COMGEO
2007
ACM
15 years 5 months ago
2007
ACM
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has b...
167
click to vote
WETICE
1997
IEEE
15 years 9 months ago
1997
IEEE
When an artifact is designed the typical output consists of documents describing the final result of a long series of deliberations and tradeoffs by the participants of collaborat...
172
click to vote
SIAMDM
2010
14 years 11 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
158
Voted
IMR
1999
Springer
15 years 9 months ago
1999
Springer
Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classe...
114
Voted
IMR
2003
Springer
15 years 10 months ago
2003
Springer
A Cartesian grid generation methodology is developed for unsteady control volume computational fluid dynamic (CFD) solvers. Arbitrary combinations and numbers of moving and statio...