Filters








202 Hits in 6.2 sec

A Survey on the Complexity of Flood-Filling Games [chapter]

Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
2018 Lecture Notes in Computer Science  
We review a recent investigation of the parameterized complexity of Flood-It when the size of a minimum vertex cover is the structural parameter.  ...  In this survey, we review recent results on one-player floodfilling games on graphs, Flood-It and Free-Flood-It, in which the player aims to make the board monochromatic with a minimum number of flooding  ...  Flood-It is in FPT when parameterized by the vertex cover number (|vc|). Definition 10.  ... 
doi:10.1007/978-3-319-98355-4_20 fatcat:2fxb6b5f7jdgxkiwbeei3ytsxe

How Bad is the Freedom to Flood-It?

Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2019 Journal of Graph Algorithms and Applications  
Their difference is that in Free-Flood-It the player has the additional freedom of choosing the vertex to play in each move.  ...  Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It.  ...  Acknowledgments The authors thank the anonymous referees for their careful comments that improved the paper in many aspects. JGAA, 23(2) 111-134 (2019) 133  ... 
doi:10.7155/jgaa.00486 fatcat:fkznu3llmjgqfifdgclfcn3nkq

How Bad is the Freedom to Flood-It? [article]

Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2018 arXiv   pre-print
Their difference is that in Free-Flood-It the player has the additional freedom of choosing the vertex to play in each move.  ...  In particular, we show that the length of an optimal solution for Fixed-Flood-It is always at most twice that of Free-Flood-It, and this is tight.  ...  Free-Flood-It parameterized by the vertex cover number admits no polynomial kernel unless PH = Σ p 3 . Proof.  ... 
arXiv:1804.08236v1 fatcat:rrmgsbdv4bc53bcdvr4suyookm

On Complexity of Flooding Games on Graphs with Interval Representations [article]

Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2013 arXiv   pre-print
The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online.  ...  In this paper, we investigate the flooding games on some graph classes characterized by interval representations.  ...  Acknowledgment The authors thank Eric Theirry for sending [LNT11] .  ... 
arXiv:1206.6201v2 fatcat:7p6ykthtbfemtdpmqxofmauvm4

On Complexity of Flooding Games on Graphs with Interval Representations [chapter]

Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2013 Lecture Notes in Computer Science  
The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online.  ...  This flooding or coloring spreads on the same color cells. It is natural to consider the coloring games on general graphs.  ...  Acknowledgment The authors thank Eric Theirry for sending [LNT11] .  ... 
doi:10.1007/978-3-642-45281-9_7 fatcat:otydzya3c5cz3mf3loarghqzoq

Sketching mesh deformations

Youngihn Kho, Michael Garland
2005 Proceedings of the 2005 symposium on Interactive 3D graphics and games - SI3D '05  
The user interacts with the system by sketching curves in the image plane. A single stroke can define a free-form skeleton and the region of the model to be deformed.  ...  By sketching the desired deformation of this reference curve, the user can implicitly and intuitively control the deformation of an entire region of the surface.  ...  The vertices in each of the 3 regions are labelled by a breadth first style "flood fill".  ... 
doi:10.1145/1053427.1053452 dblp:conf/si3d/KhoG05 fatcat:x2okbc3dy5ehdplw63tfhkkr2e

Three-Dimensional Meshes Watermarking: Review and Attack-Centric Investigation [chapter]

Kai Wang, Guillaume Lavoué, Florence Denis, Atilla Baskurt
2007 Lecture Notes in Computer Science  
Considering the important impact of the different attacks on the design of 3D mesh watermarking algorithms, we also provide an attack-centric viewpoint of this state of the art.  ...  The recent decade has seen the emergence of 3D meshes in industrial, medical and entertainment applications.  ...  The research work of the first author is funded by China Scholarship Council of Chinese government.  ... 
doi:10.1007/978-3-540-77370-2_4 fatcat:ntppw24a45hbnguvrbli7b2dfm

An agent-based market simulation for enriching innovation management education

Christian Stummer, Elmar Kiesling
2020 Central European Journal of Operations Research  
The salient feature of this simulation is its agent-based market model, which accounts for consumers' heterogeneity and social factors like word-of-mouth communication.  ...  , make resource allocation decisions, and test marketing strategies for introducing its new products.  ...  One extreme strategy, which ultimately required changes in the parameterization of the game, was to essentially "flood" the market by launching a new (not particularly advanced) product every period, thereby  ... 
doi:10.1007/s10100-020-00716-3 fatcat:mzxgcfraxfboxjpyl2mw7skwom

Interactive modeling of complex geometric details based on empirical mode decomposition for multi-scale 3D shapes

Dongbo Zhang, Xiaochao Wang, Jianping Hu, Hong Qin
2017 Computer-Aided Design  
In this process, the target surface with new transferred details could be generated by a mesh reconstruction method widely used in Laplacian surface editing.  ...  With the original positions of target surface serving as the soft constraints, the overall shape of the target model will be fully preserved.  ...  Acknowledgments This work is supported in part by National Science Founda  ... 
doi:10.1016/j.cad.2017.02.003 fatcat:rgnx7wp6bfbabae6mg5e6hp4vy

Synthesis and rendering of bidirectional texture functions on arbitrary surfaces

Xinguo Liu, Yaohua Hu, Jingdan Zhang, Xin Tong, Baining Guo, Heung-Yeung Shum
2004 IEEE Transactions on Visualization and Computer Graphics  
To addresses this challenge, we approximate the BTF sample by a small number of 4D point appearance functions (PAFs) multiplied by 2D geometry maps.  ...  As for rendering, a surface BTF synthesized using geometry maps is well-suited for leveraging the programmable vertex and pixel shaders on the graphics hardware.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their valuable comments.  ... 
doi:10.1109/tvcg.2004.1272727 pmid:18579959 fatcat:goooes24ffbxjjwbcxh4d23o7q

A Comprehensive Survey on Three-Dimensional Mesh Watermarking

Kai Wang, Guillaume Lavoue, Florence Denis, Atilla Baskurt
2008 IEEE transactions on multimedia  
Our survey covers an introduction to the relevant state of the art, an attack-centric investigation, and a list of existing problems and potential solutions.  ...  Then we give a presentation and an analysis of the existing algorithms by distinguishing them between fragile techniques and robust techniques.  ...  ACKNOWLEDGMENT The authors would like to thank C. Wolf for his careful proofreading and helpful corrections.  ... 
doi:10.1109/tmm.2008.2007350 fatcat:dvivcwdgbfdd3f25zcx56vnfne

Width Parameters Beyond Tree-width and their Applications

P. Hlineny, S.-i. Oum, D. Seese, G. Gottlob
2007 Computer journal  
These are special issues on Parameterized Complexity]), many concepts and parameters measuring the similarity or dissimilarity of structures compared to trees have been born and studied over the past years  ...  In this contribution, we demonstrate how 'width' parameters of graphs and generalized structures (such as matroids or hypergraphs), can be used to improve the design of parameterized algorithms and the  ...  Dermietzel for his help with generating some of the figures. Our last, special thanks we reserve for the editors of this volume for the invitation and their constant encouragement.  ... 
doi:10.1093/comjnl/bxm052 fatcat:n4nbasuvubc5lkajkskqk22fey

Industry applications of neutral-atom quantum computing solving independent set problems [article]

Jonathan Wurtz, Pedro Lopes, Nathan Gemelke, Alexander Keesling, Shengtao Wang
2022 arXiv   pre-print
Here, we approach this connection with a focus on a particular device architecture and explore the ubiquity and utility of independent set problems by providing examples of real-world applications.  ...  These devices are particularly well suited to solve independent set problems, as the combinatorial constraints can be naturally encoded in the low-energy Hilbert space due to the Rydberg blockade mechanism  ...  However, because of the expense of immunizing many nodes, it is optimal to choose the minimum vertex cover of the graph, which perfectly contains the spread with the minimum number of immunizations.  ... 
arXiv:2205.08500v1 fatcat:2t7aoavg65dmfd3tnt7lkvuf5m

Graph Representation Learning: A Survey [article]

Fenxiao Chen, Yuncheng Wang, Bin Wang, C.-C. Jay Kuo
2019 arXiv   pre-print
In this review, we first explain the graph embedding task and its challenges. Next, we review a wide range of graph embedding techniques with insights.  ...  Various graph embedding techniques have been developed to convert the raw graph data into a low-dimensional vector representation while preserving the intrinsic graph properties.  ...  To the best of our knowledge, this library covers the largest number of graph embedding techniques up to now. 1) Vertex Classification We compare vertex classification accuracy of seven graph embedding  ... 
arXiv:1909.00958v1 fatcat:6wbxy5jjx5ditbiiviwbuqyww4

Proxy-guided Image-based Rendering for Mobile Devices

Bernhard Reinert, Johannes Kopf, Tobias Ritschel, Eduardo Cuervo, David Chu, Hans-Peter Seidel
2016 Computer graphics forum (Print)  
It runs in real-time even on very weak mobile devices, supports modern game engine graphics, and maintains high visual quality even for large view displacements.  ...  It performs as fast as the fastest competitors but maintains much higher visual quality for larger displacements. The insets compare against other common approaches and show the RGB-DSSIM difference.  ...  This closes tiny gaps in the original mesh. Next, we remove big internal holes by flood-filling from the outside and inverting the selection.  ... 
doi:10.1111/cgf.13032 fatcat:let3bsqcczgrdaxviawjkhidsa
« Previous Showing results 1 — 15 out of 202 results