Graph Grammar Deep Dive: Graph Gluing, Boundaries, and Hierarchies

Поделиться
HTML-код
  • Опубликовано: 18 ноя 2024
  • НаукаНаука

Комментарии • 7

  • @lmthelex
    @lmthelex Месяц назад +1

    amazing

  • @AndarManik
    @AndarManik Месяц назад +1

    this is awesome.

  • @WaterWheel990
    @WaterWheel990 Месяц назад +3

    Fantastic work

  • @douira
    @douira Месяц назад +2

    Very cool

  • @Mondotrasho23
    @Mondotrasho23 Месяц назад +2

    Thanks for this video I just started writing a report 3 days ago for the final submission of a year 3 subject of my undergraduate degree based on your Example-Based Procedural Modeling Using Graph Grammars paper and the overall algorithm.
    Its really interesting stuff this video did a good job explaining some of the concepts that have been taking me a while.
    I have been trying to code my own version of some of these steps as part of my learning process I have been able to create primitives from shapes as that's relatively straight forward but I feel like I am missing some step when it comes to how you label faces and therefore get the left and right values for your edge labels.
    One point of confusion for me is figure 3 a where you show labeling of faces but I am confused as to why the faces that a bar intercept are both labeled/coloured as 0/white and are not their own colour.
    This might be a a common method that I am just not familiar with but I would apreciate any pointers if you have any.
    I have also subscribed to your source code emailing list and greatly look forward to you releasing something to play with when you do.

    • @PaulMerrellResearch
      @PaulMerrellResearch  Месяц назад +1

      @Mondotrasho23 An edge can divide two faces with the different colors, but it can also divide two faces with the same color. At 3:18, I'm describing how my method produces different results depending on if the faces are labeled the same or are labeled differently. In Figure 3(a), the edge c-tilde has different colors on the left and on the right. c-tilde = (left, right, angle) = (1, 0, 150°). The edge a-tilde has the same color on the left and on the right a-tilde = (0, 0, 45°).

    • @Mondotrasho23
      @Mondotrasho23 Месяц назад

      @@PaulMerrellResearch OH that makes total sense now. I was reading into the one example in figure 3(a) as a lot of my basis prior to watching this video today and hadn't made the connection that it was a case similar to the fork input shape in figure 8(d) and was assuming all the edges were loops thank you.
      I also wasn't considering the same interior exterior case.
      And I really apreciate your reply