Sciweavers

83 search results - page 3 / 17
» Enumeration of Regular Triangulations
Sort
View
DCG
2008
118views more  DCG 2008»
13 years 5 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
COCOON
2009
Springer
13 years 9 months ago
Three New Algorithms for Regular Language Enumeration
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
Margareta Ackerman, Erkki Mäkinen
DM
1999
96views more  DM 1999»
13 years 5 months ago
Buekenhout unitals
The only known enumeration of Buekenhout unitals occurs in the Desarguesian plane PG(2, q2). In this paper we develop general techniques for enumerating the nonsingular Buekenhout...
Gary L. Ebert
MSCS
2006
93views more  MSCS 2006»
13 years 5 months ago
Uniform regular enumerations
Abstract. In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalizati...
Ivan N. Soskov, Bogomil Kovachev
WIA
2007
Springer
13 years 12 months ago
Efficient Enumeration of Regular Languages
Margareta Ackerman, Jeffrey Shallit