Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Finite or discrete collections of geometric objects. Packings, tilings, polyhedra, polytopes, intersection, arrangements, rigidity.
7
votes
0
answers
123
views
Points on $k$ Circles
Let $k$ be a fixed positive integer. We want to find the minimum number $f(k)$, such that for a set of finite points in the plane, if any $f(k)$ of them are on $k$ circles, then all of them are on $k$ …
7
votes
Accepted
Dropping altitudes to achieve nonobtuse planar triangulations: finite or infinite?
There is an example for a triangulation with just one obtuse triangle in each step.
In the image, only triangle $A_1A_2O$ is obtuse. With your algorithm we draw altitudes and reach $H_1,H_2,H_3,...$ …
4
votes
0
answers
160
views
Closest integer point to a sphere with radius R
I have a sphere in $\mathbb{R}^d$ with radius $R$ whose center is not necessarily the origin. I am interested in the closest integer lattice point to it. Indeed, it depends on the center location, but …
2
votes
0
answers
135
views
From Planar Graphs To Tangent Circles
I have a conjecture:
"For each planar graph with vertices $V_1, V_2,\ldots, V_n$ there exist disjoint circles $w_1,w_2,\ldots,w_n$ in the plane, such that for every $i,j$, $w_i$ is tangent to $w_j$ i …
0
votes
Unit-Distance Polyhedra
I think this problem could be useful for you, "Choombam"s are other types with your conditions:
http://artofproblemsolving.com/community/c6h111388p632753