scholarly journals Extending a combinatorial geometry by adding a unique line

1989 ◽  
Vol 46 (1) ◽  
pp. 118-120 ◽  
Author(s):  
Mark D Halsey
Keyword(s):  
Combinatorial Geometry ◽  
Unique Line

Results and Problems in Combinatorial Geometry

1985 ◽  
Author(s):  
Vladimir G. Boltjansky ◽  
Israel Gohberg
Keyword(s):  
Combinatorial Geometry

scholarly journals Quantitative combinatorial geometry for concave functions

2021 ◽  
Vol 182 ◽  
pp. 105465
Author(s):  
Sherry Sarkar ◽  
Alexander Xue ◽  
Pablo Soberón
Keyword(s):  
Combinatorial Geometry ◽  
Concave Functions

Algorithms in Combinatorial Geometry.

1989 ◽  
Vol 96 (5) ◽  
pp. 457
Author(s):  
Jacob E. Goodman ◽  
Herbert Edelsbrunner
Keyword(s):  
Combinatorial Geometry

Linear geometries on the Moebius strip: A theorem of Skornyakov type

2005 ◽  
Vol 72 (1) ◽  
pp. 17-30
Author(s):  
Rainer Löwen ◽  
Burkard Polster
Keyword(s):  
Linear Space ◽  
Real Line ◽  
Open Disk ◽  
Stable Plane ◽  
Linear Spaces ◽  
Unique Line ◽  
The Real ◽  
Continuity Properties ◽  
Point Set ◽  
Moebius Strip

We show that the continuity properties of a stable plane are automatically satisfied if we have a linear space with point set a Moebius strip, provided that the lines are closed subsets homeomorphic to the real line or to the circle. In other words, existence of a unique line joining two distinct points implies continuity of join and intersection. For linear spaces with an open disk as point set, the same result was proved by Skornyakov.

Combinatorial Geometry

1991 ◽  
pp. 131-148
Author(s):  
Hallard T. Croft ◽  
Kenneth J. Falconer ◽  
Richard K. Guy
Keyword(s):  
Combinatorial Geometry

UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES

2000 ◽  
Vol 10 (03) ◽  
pp. 227-266 ◽  
Author(s):  
SHANG-HUA TENG ◽  
CHI WAI WONG
Keyword(s):  
Numerical Analysis ◽  
Data Structures ◽  
Mesh Generation ◽  
Unstructured Mesh ◽  
Combinatorial Geometry ◽  
Scientific Applications ◽  
Mathematical Proofs ◽  
Generation Theory ◽  
Unstructured Mesh Generation

Mesh generation is a great example of inter-disciplinary research. Its development is built upon advances in computational and combinatorial geometry, data structures, numerical analysis, and scientific applications. Its success is justified not only by mathematical proofs about the quality and the numerical relevancy of geometry-based meshing algorithms, but also by the performance of meshing software in real applications. It embraces both provably good algorithms and practical heuristics. This paper presents a brief overview of algorithms, theorems, and software in mesh generation.

Sign in / Sign up

Export Citation Format

Share Document