Knowledge (XXG)

Moore neighborhood

Source 📝

20: 178:: A sequence B (b1, b2, ..., bk) of boundary pixels i.e. the contour. Define M(a) to be the Moore neighborhood of pixel a. Let p denote the current boundary pixel. Let c denote the current pixel under consideration i.e. c is in M(p). Let b denote the backtrack of c (i.e. neighbor pixel of p that was previously tested) 283:
The original termination condition was to stop after visiting the start pixel for the second time. This limits the set of contours the algorithm will walk completely. An improved stopping condition proposed by Jacob Eliosoff is to stop after entering the start pixel for the second time in the same
156:
The idea behind the formulation of Moore neighborhood is to find the contour of a given graph. This idea was a great challenge for most analysts of the 18th century, and as a result an algorithm was derived from the
131: 373: 85:
The concept can be extended to higher dimensions, for example forming a 26-cell cubic neighborhood for a cellular automaton in three dimensions, as used by
366: 529: 405: 488: 410: 359: 470: 445: 425: 420: 460: 440: 493: 450: 480: 400: 293: 664: 508: 465: 19: 435: 534: 415: 351: 308: 96: 60: 382: 64: 23:
The Moore neighborhood is composed of nine cells: a central cell and the eight cells which surround it.
642: 587: 503: 386: 79: 322: 72: 28: 550: 48: 298: 602: 592: 570: 325: 36: 257:(advance the current pixel c to the next clockwise pixel in M(p) and update backtrack) 658: 635: 59:
It is one of the two most commonly used neighborhood types, the other one being the
556: 430: 597: 455: 158: 68: 174:: A square tessellation, T, containing a connected component P of black cells. 563: 303: 165: 341: 330: 247:(backtrack: move the current pixel c to the pixel from which p was entered) 67:, for example, uses the Moore neighborhood. It is similar to the notion of 39:
and is composed of a central cell and the eight cells that surround it.
618: 78:
The Moore neighbourhood of a cell is the cell itself and the cells at a
86: 498: 18: 16:
Cellular automaton neighborhood consisting of eight adjacent cells
221:
b = the pixel from which s was entered during the image scan.
355: 161:
which was later called the Moore Neighborhood algorithm.
346: 133:, the size of the neighborhood is 3 − 1. 225:c to be the next clockwise pixel (from b) in M(p). 99: 209:a black pixel, s, of P is found. Insert s in B. 627: 611: 580: 543: 517: 479: 393: 63:, which excludes the corner cells. The well known 125: 266:c = next clockwise pixel (from b) in M(p). 252:c = next clockwise pixel (from b) in M(p). 367: 136:In two dimensions, the number of cells in an 8: 168:for the Moore-Neighbor tracing algorithm is 51:, a pioneer of cellular automata theory. 374: 360: 352: 126:{\displaystyle 0\leq d,d\in \mathbb {Z} } 119: 118: 98: 284:direction you originally entered it. 7: 14: 237:black insert c in B 47:The neighborhood is named after 35:is defined on a two-dimensional 1: 213:the current boundary point p 140:Moore neighbourhood of range 294:Neighbourhood (graph theory) 681: 205:right scan the cells of T 535:Von Neumann neighborhood 309:Von Neumann neighborhood 229:c not equal to s do 61:von Neumann neighborhood 342:The Moore neighborhood 127: 24: 383:Conway's Game of Life 279:Termination condition 128: 65:Conway's Game of Life 22: 326:"Moore Neighborhood" 97: 525:Moore neighborhood 504:Life without Death 323:Weisstein, Eric W. 123: 80:Chebyshev distance 33:Moore neighborhood 25: 665:Cellular automata 652: 651: 387:cellular automata 148: + 1). 73:computer graphics 29:cellular automata 672: 376: 369: 362: 353: 336: 335: 132: 130: 129: 124: 122: 680: 679: 675: 674: 673: 671: 670: 669: 655: 654: 653: 648: 628:Popular culture 623: 607: 576: 544:Implementations 539: 513: 475: 389: 380: 321: 320: 317: 290: 281: 276: 154: 95: 94: 89:. In dimension 57: 49:Edward F. Moore 45: 17: 12: 11: 5: 678: 676: 668: 667: 657: 656: 650: 649: 647: 646: 639: 631: 629: 625: 624: 622: 621: 615: 613: 609: 608: 606: 605: 600: 595: 593:Martin Gardner 590: 584: 582: 578: 577: 575: 574: 571:Anonymous;Code 567: 560: 553: 547: 545: 541: 540: 538: 537: 532: 530:Speed of light 527: 521: 519: 515: 514: 512: 511: 506: 501: 496: 491: 485: 483: 477: 476: 474: 473: 468: 463: 458: 453: 448: 443: 438: 433: 428: 423: 418: 413: 408: 406:Garden of Eden 403: 397: 395: 391: 390: 381: 379: 378: 371: 364: 356: 350: 349: 337: 316: 313: 312: 311: 306: 301: 296: 289: 286: 280: 277: 170: 153: 150: 121: 117: 114: 111: 108: 105: 102: 56: 53: 44: 41: 37:square lattice 15: 13: 10: 9: 6: 4: 3: 2: 677: 666: 663: 662: 660: 645: 644: 640: 638: 637: 633: 632: 630: 626: 620: 617: 616: 614: 610: 604: 601: 599: 596: 594: 591: 589: 586: 585: 583: 579: 573: 572: 568: 566: 565: 561: 559: 558: 554: 552: 549: 548: 546: 542: 536: 533: 531: 528: 526: 523: 522: 520: 516: 510: 507: 505: 502: 500: 497: 495: 492: 490: 489:Day and Night 487: 486: 484: 482: 481:Life variants 478: 472: 469: 467: 464: 462: 459: 457: 454: 452: 449: 447: 444: 442: 439: 437: 434: 432: 429: 427: 424: 422: 419: 417: 414: 412: 409: 407: 404: 402: 399: 398: 396: 392: 388: 384: 377: 372: 370: 365: 363: 358: 357: 354: 348: 347:cell-auto.com 344: 343: 338: 333: 332: 327: 324: 319: 318: 314: 310: 307: 305: 302: 300: 297: 295: 292: 291: 287: 285: 278: 275: 272: 269: 265: 261: 258: 255: 251: 248: 244: 240: 236: 232: 228: 224: 220: 217:s i.e. p=s 216: 212: 208: 204: 200: 196: 192: 188: 184: 181: 177: 173: 169: 167: 162: 160: 151: 149: 147: 143: 139: 134: 115: 112: 109: 106: 103: 100: 92: 88: 83: 81: 76: 74: 70: 66: 62: 54: 52: 50: 42: 40: 38: 34: 30: 21: 641: 634: 569: 562: 557:Life Genesis 555: 524: 431:Puffer train 385:and related 340: 339:Tyler, Tim, 329: 299:King's graph 282: 273: 270: 267: 263: 262:b = c 259: 256: 253: 249: 246: 245:p = c 242: 241:b = p 238: 234: 230: 226: 222: 218: 214: 210: 206: 202: 198: 194: 190: 189:be empty. 186: 182: 179: 175: 171: 163: 155: 145: 141: 137: 135: 90: 84: 77: 58: 46: 32: 26: 603:Richard Guy 598:Bill Gosper 588:John Conway 456:Spacefiller 159:Moore graph 69:8-connected 581:Key people 564:Video Life 471:Still life 446:Replicator 426:Oscillator 421:Methuselah 394:Structures 315:References 304:Chain code 166:pseudocode 144:is (2 71:pixels in 55:Importance 461:Spaceship 441:Reflector 331:MathWorld 271:end While 152:Algorithm 116:∈ 104:≤ 659:Category 619:LifeWiki 612:Websites 518:Concepts 494:Highlife 451:Sawtooth 288:See also 138:extended 401:Breeder 193:bottom 87:3D Life 411:Glider 268:end If 176:Output 93:where 82:of 1. 31:, the 636:Bloom 551:Golly 509:Seeds 499:Lenia 466:Spark 227:While 207:until 201:left 180:Begin 172:Input 643:Wake 436:Rake 254:else 197:top 191:From 164:The 43:Name 416:Gun 345:at 274:End 264:Let 260:Let 250:Let 243:Let 239:Let 223:Set 219:Let 211:Set 199:and 183:Set 27:In 661:: 328:. 235:is 233:c 231:If 215:to 203:to 195:to 187:to 185:B 91:d, 75:. 375:e 368:t 361:v 334:. 146:r 142:r 120:Z 113:d 110:, 107:d 101:0

Index


cellular automata
square lattice
Edward F. Moore
von Neumann neighborhood
Conway's Game of Life
8-connected
computer graphics
Chebyshev distance
3D Life
Moore graph
pseudocode
Neighbourhood (graph theory)
King's graph
Chain code
Von Neumann neighborhood
Weisstein, Eric W.
"Moore Neighborhood"
MathWorld
The Moore neighborhood
cell-auto.com
v
t
e
Conway's Game of Life
cellular automata
Breeder
Garden of Eden
Glider
Gun

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.