The On-Line Encyclopedia of Bongard Problems

Search: subworld:curves_and_fill_shapes_drawing

Displaying 61-70 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)

BP299

Lines if slightly extended make up a regular polygon vs. lines if slightly extended cannot make up a regular polygon.

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

	CROSSREFS	`Adjacent-numbered pages: BP294 BP295 BP296 BP297 BP298 * BP300 BP301 BP302 BP303 BP304`
	KEYWORD	`traditional`
	CONCEPT	`imperfection_small (info \| search)`
	WORLD	`segments [smaller \| same \| bigger]`
	AUTHOR	`"Lewis"`

BP304

At least one (interior or exterior) right angle vs. no right angle (either interior or exterior).

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

	CROSSREFS	`Adjacent-numbered pages: BP299 BP300 BP301 BP302 BP303 * BP305 BP306 BP307 BP308 BP309`
	KEYWORD	`traditional, finishedexamples`
	WORLD	`polygon_outline [smaller \| same \| bigger]`
	AUTHOR	`"Lewis"`

BP328

All sides are equal vs. all angles are equal.

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

	CROSSREFS	`Adjacent-numbered pages: BP323 BP324 BP325 BP326 BP327 * BP329 BP330 BP331 BP332 BP333`
	KEYWORD	`nice, stretch, left-narrow, right-narrow, traditional, finishedexamples, both`
	CONCEPT	`angle (info \| search),` `length_line_or_curve (info \| search),` `same_feature (info \| search),` `same (info \| search)`
	WORLD	`polygon_outline [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP329

Regular polygon vs. not regular polygon.

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

	CROSSREFS	`Adjacent-numbered pages: BP324 BP325 BP326 BP327 BP328 * BP330 BP331 BP332 BP333 BP334`
	KEYWORD	`precise, allsorted, stretch, traditional, finishedexamples, preciseworld`
	CONCEPT	`angle (info \| search),` `same_feature (info \| search),` `same (info \| search)`
	WORLD	`polygon_outline [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP340

Regular star polygon vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP335 BP336 BP337 BP338 BP339 * BP341 BP342 BP343 BP344 BP345`
	KEYWORD	`math, traditional`
	CONCEPT	`tracing_line_or_curve (info \| search),` `vertex_of_meeting_lines (info \| search),` `write_in_single_stroke (info \| search)`
	WORLD	`figure_made_of_segments [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP342

Exactly one axis of symmetry vs. either zero or more than one axis of symmetry.

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

	CROSSREFS	`Adjacent-numbered pages: BP337 BP338 BP339 BP340 BP341 * BP343 BP344 BP345 BP346 BP347`
	KEYWORD	`traditional, finishedexamples`
	CONCEPT	`exists_one (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search),` `symmetry_axis (info \| search),` `symmetry (info \| search)`
	WORLD	`shape_outline [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP348

Shape on the right is the convex hull of shape on the left vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP343 BP344 BP345 BP346 BP347 * BP349 BP350 BP351 BP352 BP353`
	KEYWORD	`precise, unstable, perfect, orderedpair, traditional`
	CONCEPT	`convex_hull (info \| search)`
	WORLD	`2_fill_shapes [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP390

Each graph vertex is uniquely defined by its connections (the graph does not admit nontrivial automorphisms) vs. the graph admits nontrivial automorphisms.

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

	CROSSREFS	`Adjacent-numbered pages: BP385 BP386 BP387 BP388 BP389 * BP391 BP392 BP393 BP394 BP395`
	KEYWORD	`precise, allsorted, notso, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `self-reference (info \| search),` `topological_transformation (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP391

There exists an edge such that removing it yields two disconnected graphs (i.e., the minimum number of edges whose removal results in two disconnected graphs is 1) vs. the minimum number of edges whose removal results in two disconnected graphs is 2.

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

	CROSSREFS	`Adjacent-numbered pages: BP386 BP387 BP388 BP389 BP390 * BP392 BP393 BP394 BP395 BP396`
	KEYWORD	`nice, precise, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `existence (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP557

Equal horizontal length vs. not

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

	COMMENTS	`All examples in this Problem are pairs of straight line segments.` `This problem communicates the idea of projected distance, in this case from 2D to 1D (x-axis).`
	CROSSREFS	`Adjacent-numbered pages: BP552 BP553 BP554 BP555 BP556 * BP558 BP559 BP560 BP561 BP562`
	KEYWORD	`nice, precise, allsorted, stretch, perfect, unorderedpair, preciseworld`
	CONCEPT	`projection (info \| search)`
	WORLD	`two_segments [smaller \| same \| bigger]`
	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!)