The On-Line Encyclopedia of Bongard Problems

Search: subworld:curves_and_fill_shapes_drawing

Displaying 91-100 of 104 results found.

( prev | next ) page 1 2 3 4 5 6 7 8 9 10 11

Sort: id Format: long Filter: (all | no meta | meta) Mode: (words | no words)

Shapes have equal area vs. not so.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP930 BP931 BP932 BP933 BP934 * BP936 BP937 BP938 BP939 BP940`
	KEYWORD	`nice, precise, allsorted, unstable, left-narrow, perfect, pixelperfect, unorderedpair`
	CONCEPT	`area (info \| search)`
	WORLD	`2_fill_shapes [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP937

Shapes have equal perimeter vs. not so.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP932 BP933 BP934 BP935 BP936 * BP938 BP939 BP940 BP941 BP942`
	KEYWORD	`precise, allsorted, unstable, left-narrow, perfect, unorderedpair`
	CONCEPT	`perimeter (info \| search)`
	WORLD	`2_fill_shapes [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP990

The center of mass can "see" (in straight lines) all points within the shape vs. the center of mass is not located in a region where it can see (in straight lines) all points.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`Another way of thinking about the solution is considering whether a light source placed at the center of mass of a given example would illuminate the whole shape.`
	CROSSREFS	`Every left for this Problem would be will be a left example for both BP367 and BP368.` `Adjacent-numbered pages: BP985 BP986 BP987 BP988 BP989 * BP991 BP992 BP993 BP994 BP995`
	KEYWORD	`convoluted, perfect`
	CONCEPT	`inside (info \| search),` `center_of_mass (info \| search),` `imagined_point (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search)`
	WORLD	`fill_shape_seeing_point_center_of_mass_inside [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP991

Can be arranged with multiple copies of itself to form some convex shape vs. not so.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`This is a generalization of BP820.` `Adjacent-numbered pages: BP986 BP987 BP988 BP989 BP990 * BP992 BP993 BP994 BP995 BP996`
	KEYWORD	`precise, allsorted, perfect`
	CONCEPT	`tiling (info \| search)`
	WORLD	`fill_shape [smaller \| same \| bigger] zoom in left`
	AUTHOR	`Leo Crabbe`

BP992

Concave shapes with concave cavities vs. convex cavities

(edit; present; nest [left/right]; search; history)

	COMMENTS	`All examples in this Problem are solid concave black shapes. In this Problem, the "cavities" of a concave shape are defined to be the convex hull of the shape minus the shape itself. For example, if you take a bite out of the edge of a piece of paper, the piece of paper in your mouth is the cavity of the bitten piece of paper. The idea may be indefinitely extended, considering whether the cavities of the cavities are concave or convex, and so on.`
	CROSSREFS	`Adjacent-numbered pages: BP987 BP988 BP989 BP990 BP991 * BP993 BP994 BP995 BP996 BP997`
	KEYWORD	`nice, precise, perfect, traditional`
	CONCEPT	`recursion_number (info \| search),` `recursion (info \| search)`
	WORLD	`concave_fill_shape [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP1011

Polygon can be inscribed in a circle vs. not so.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP1006 BP1007 BP1008 BP1009 BP1010 * BP1012 BP1013 BP1014 BP1015 BP1016`
	KEYWORD	`hard, precise, stretch, challenge, left-narrow, perfect, preciseworld`
	CONCEPT	`circle (info \| search),` `imagined_entity (info \| search)`
	WORLD	`fill_polygon [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP1016

Rigid vs. not rigid.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`Henneberg, L. (1911), Die graphische Statik der starren Systeme, Leipzig` `Jackson, Bill. (2007). Notes on the Rigidity of Graphs.` `Laman, Gerard. (1970), "On graphs and the rigidity of plane skeletal structures", J. Engineering Mathematics, 4 (4): 331–340.` `Pollaczek‐Geiringer, Hilda (1927), "Über die Gliederung ebener Fachwerke", Zeitschrift für Angewandte Mathematik und Mechanik, 7 (1): 58–72.`
	CROSSREFS	`Adjacent-numbered pages: BP1011 BP1012 BP1013 BP1014 BP1015 * BP1017 BP1018 BP1019 BP1020 BP1021`
	KEYWORD	`nice, physics, help`
	CONCEPT	`rigidity (info \| search),` `graph (info \| search),` `imagined_motion (info \| search)`
	WORLD	`planar_connected_graph [smaller \| same \| bigger] zoom in left (rigid_planar_connected_graph)`
	AUTHOR	`Aaron David Fairbanks`

BP1055

Equidiagonal quadrilaterals vs. non-equidiagonal quadrilaterals

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Equidiagonal_quadrilateral`
	CROSSREFS	`Adjacent-numbered pages: BP1050 BP1051 BP1052 BP1053 BP1054 * BP1056 BP1057 BP1058 BP1059 BP1060`
	KEYWORD	`hard, antihuman`
	WORLD	`fill_quadrilateral [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP1099

Considering only the ways they are connected, anything that can be said about a given node can be said about every other node vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Vertex-transitive_graph`
	CROSSREFS	`Adjacent-numbered pages: BP1094 BP1095 BP1096 BP1097 BP1098 * BP1100 BP1101 BP1102 BP1103 BP1104`
	KEYWORD	`precise, allsorted, notso, math, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left`
	AUTHOR	`Leo Crabbe`

BP1100

There is a path between any two nodes vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Graph_theory` `https://en.wikipedia.org/wiki/Connectivity_(graph_theory)`
	CROSSREFS	`Adjacent-numbered pages: BP1095 BP1096 BP1097 BP1098 BP1099 * BP1101 BP1102 BP1103 BP1104 BP1105`
	KEYWORD	`precise, allsorted, world, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `connected_component (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left (connected_graph) \| zoom in right (disconnected_graph)`
	AUTHOR	`Leo Crabbe`

( prev | next ) page 1 2 3 4 5 6 7 8 9 10 11

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)